Skip Navigation



Journal of Logic and Computation Advance Access published online on April 22, 2008
Journal of Logic and Computation, doi:10.1093/logcom/exn001
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Colson, L.
Right arrow Articles by Michel, D.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original Papers

Pedagogical Second-order Propositional Calculi

Loïc Colson and David Michel

University of Metz, Metz, France E-mail: colson{at}univ-metz.fr; david.michel{at}univ-metz.fr

Received 18 June 2007.

The present work introduces the notion of pedagogical natural deduction systems, which are natural deduction systems with the following additional constraint: all hypotheses made in a proof must be motivated by an example. Technically speaking, we replace the rule (Hyp):

Formula

with the rule (PHyp):

Formula

with {sigma} denoting a substitution replacing all variables of {Gamma} with an example. This substitution is called the motivation of {Gamma}. These systems are in essence negationless. In the present article, we study the second-order propositional calculus, since it is the simplest non-trivial natural deduction system in which the negation is definable. Some pedagogical versions of the second-order propositional calculus are proposed. We argue that these pedagogical calculi are negationless and we study their expressive power.

Keywords: Constructive mathematics; mathematical logic; natural deduction; negationless mathematics; typed {lambda}-calculus



References

  1. Colson L. Quelques remarques sur l'environnement dans la Théorie Intuitionniste des Types. In: D.E.A. Report (1986) Orsay: University of Paris Sud.
  2. Colson L, Michel D. Pedagogical natural Deduction systems: the propositional case. In: Publications du LITA, No. 2006-101 (2006) Metz: Université Paul Verlaine.
  3. Friedman H. Classically and Intuitionistically Provably Recursive Functions. Higher Set Theory (1978) Vol. 669. Springer Lecture Notes. 21–27.[CrossRef]
  4. Gentzen G. Investigations into logical deduction. Mathematische Zeitschrift (1935) 39:176–210. 405–431. Reprinted in The Collected Papers of Gerhard Gentzen. Studies in Logic and the Foundations of Mathematics, North-Holland, 1969.[CrossRef][ISI]
  5. Gilmore PCG. The Effect of Griss' Criticism of the intuitionistic logic on deductive theories formalized within the intuitionistic logic. Indagationes Mathematicæ (1953) 15:162–174. 175–186.
  6. Girard J-Y, Lafont Y, Taylor P. Proofs and Types. (1989) Cambridge, UK: Cambridge University Press.
  7. Griss GFC. Negationless intuitionistic mathematics. Indagationes Mathematicæ (1946) 8:675–681.
  8. Griss GFC. Negationless intuitionistic mathematics II. Indagationes Mathematicæ (1950) 12:108–115.
  9. Griss GFC. Negationless intuitionistic mathematics III. Indagationes Mathematicæ (1951) 13:193–199.
  10. Griss GFC. Negationless intuitionistic mathematics IVa, IVb. Indagationes Mathematicæ (1951) 13:452–462. 463–471.
  11. Heyting A. Intuitionism: An Introduction. Studies in Logic and the Foundations of Mathematics (1956) North-Holland.
  12. Krivtsov VN. A negationless interpretation of intuitionistic theories I. Studia Logica (2000) 64:323–344.[CrossRef]
  13. Krivtsov VN. A negationless interpretation of intuitionistic theories II. Studia Logica (2000) 65:155–179.[CrossRef]
  14. Mezhlumbekova V. Deductive capabilities of negationless intuitionistic arithmetic. Moscow University Mathematical Bulletin. (1975) Vol. 30.
  15. Mints G. Notes on constructive negation. Synthese (2006) 148:701–717.[CrossRef][ISI]
  16. Nelson D. Non-null implication. Journal of Symbolic Logic (1966) 31:562–572.[CrossRef][ISI]
  17. Nelson D. A complete negationless system. Studia Logica (1973) 32:41–49.[CrossRef]
  18. Poincaré H. Dernières Pensées (1913) Paris: Flammarion. English translation in Last Thoughts, Dover Publications, NY. 1963.
  19. Prawitz D. Natural Deduction, A Proof-theoretical Study. (1965) Stockholm: Almquist and Wiksell.
  20. Valpola V. Ein system der negationslosen logik mit ausschliesslich realisierbaren Prädicaten. Acta Philosophica Fennica (1955) 9:1–247.
  21. Vredenduin PGJ. The logic of negationless mathematics. Compositio Mathematica (1953) 11:204–277.

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Colson, L.
Right arrow Articles by Michel, D.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?