Une preuve formelle et intuitionniste du théorème de complétude de la logique classique

Bulletin of Symbolic Logic

Volumn 2, Issue 4, 1996, Pages 405-421

  Krivine, Jean Louis ^a  

^a INSTITUT DE MATHÉMATIQUES DE JUSSIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030299480     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2307/421172     Document Type: Article

References (9)

1. V. DANOS, J. B. JOINET, and H. SCHELLINX, LKQ and LKT: Sequent calculi for second order logic based on dual linear decompositions of classical implication, Proceedings of the workshop on linear logic at Cornell 1993, Cambridge University Press, 1995.
2. G. KREISEL, On weak completeness of intuitionisticpredicate logic, this JOURNAL, vol. 27 (1962), pp. 139-158.
3. J. L. KRIVINE, Lambda-calcul, types et modèles, Masson, Paris, 1990, English translation: Lambda-calculus, types and models, Ellis Horwood, 1993.
4. J. L. KRIVINE, Lambda-calcul, types et modèles, Masson, Paris, 1990, English translation: Lambda-calculus, types and models, Ellis Horwood, 1993.
5. _, Classical logic, storage operators and second order lambda-calculus, Annals of Pure and Applied Logic, vol. 68 (1994), pp. 53-78.
6. M. PARIGOT, λμ-calculus: an algorithmic interpretation of classical natural deduction, Proceedings of logical programming and automated reasoning, St. Petersbourg, Lecture Notes in Computer Science, no. 624, Springer-Verlag, 1992, pp. 190-201.
7. _, Classical proofs as programs, Proceedings KGC '93, Lecture Notes in Computer Science, no. 713, Springer-Verlag, 1993, pp. 263-276.
8. A. S. TROELSTRA and D. VAN DALEN, Constructivism in mathematics, vol. II, North Holland, 1988.
9. W. VELDMAN, An intuitionistic completeness theorem for intuitionistic predicate logic, this JOURNAL, vol. 41 (1976), pp. 159-166.