Journal of Symbolic Logic

A short proof of the strong normalization of classical natural deduction with disjunction

René David and Karim Nour

Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

We give a direct, purely arithmetical and elementary proof of the strong normalization of the cut-elimination procedure for full (i.e., in presence of all the usual connectives) classical natural deduction.

Article information

Source
J. Symbolic Logic Volume 68, Issue 4 (2003), 1277-1288.

Dates
First available in Project Euclid: 31 October 2003

Permanent link to this document
http://projecteuclid.org/euclid.jsl/1067620187

Digital Object Identifier
doi:10.2178/jsl/1067620187

Mathematical Reviews number (MathSciNet)
MR2017355

Zentralblatt MATH identifier
02133231

Citation

David, René; Nour, Karim. A short proof of the strong normalization of classical natural deduction with disjunction. J. Symbolic Logic 68 (2003), no. 4, 1277--1288. doi:10.2178/jsl/1067620187. http://projecteuclid.org/euclid.jsl/1067620187.


Export citation

References

  • Y. Andou Church-Rosser property of a simple reduction for full first-order classical natural deduction, Annals of Pure and Applied Logic, vol. 119 (2003), pp. 225--237.
  • F. Barbanera and S. Berardi A symmetric lambda calculus for ``classical'' program extraction, Proceedings of theoretical aspects of computer software, tacs '94 (M. Hagiya and J.C. Mitchell, editors), Lecture Notes in Computer Science, vol. 789, Springer Verlag,1994, pp. 495--515.
  • E. T. Bittar Strong Normalisation Proofs for Cut-Elimination in Gentzen's Sequent Calculi, Logic, algebra and computer science, vol. 46, Banach Center Publications,1999, pp. 179--225.
  • R. Constable and C. Murthy Finding computational content in classical proofs, Logical frameworks (G. Huet and G. Plotkin, editors), Cambridge University Press,1991, pp. 341--362.
  • R. David Normalization without reducibility, Annals of Pure and Applied Logic, vol. 107 (2001), pp. 121--130.
  • R. David and B. Guillaume Strong normalization of the typed $\lambda_ws$-calculus, Accepted in the CSL'03 colloquium.
  • R. David and K. Nour A short proof of the strong normalization of the simply typed $\l \m$-calculus, Schedae Informaticae, vol. 12 (2003), To appear.
  • P. de Groote On the strong normalization of natural deduction with permutation-conversions, In 10th International Conference on Typed Lambda Calculi and Applications, TLCA '95, Lecture Notes in Computer Science, vol. 902, Springer Verlag,1995, pp. 201--205.
  • J.-Y. Girard A new constructive logic: classical logic, Mathematical Structures in Computer Science, vol. 1 (1991), pp. 255--296.
  • F. Joachimski and R. Matthes Short proofs of normalization for the simply-typed $\lambda$-calculus, permutative conversions and Gödel's $T$, Archive for Mathematical Logic, vol. 42 (2003), pp. 59--87.
  • J.-L. Krivine Classical logic, storage operators and 2nd order lambda-calculus, Annals of Pure and Applied Logic, vol. 68 (1994), pp. 53--78.
  • J.J. Levy Reductions correctes et optimales dans le lambda-calcul, Ph.D. thesis, Paris 7,1978.
  • C.R. Murthy An evaluation semantics for classical proofs, Proceedings of the sixth annual IEEE symposium on logic in computer science,1991, pp. 96--107.
  • K. Nour and K. Saber A semantical proof of the strong normalization theorem of full propositionnal classical natural deduction, Manuscript,2003.
  • M. Parigot $\lambda\mu$-calculus: An algorithmic interpretation of classical natural deduction, Logic programming and automated reasoning (St. Petersburg, 1992), Lecture Notes in Computer Science, vol. 624, Springer Verlag,1992, pp. 190--201.
  • D. Prawitz Natural deduction. A proof-theoretical study, Almqvist & Wiksell, Stockholm,1965.
  • D. Pym and E. Ritter On the semantics of classical disjunction, Journal of Pure and Applied Algebra, to appear.
  • N. J. Rehof and M. H. Sorensen The $\lambda_\Delta$-calculus, Proceedings of the international symposium on theoretical aspects of computer software, TACS'94, Lecture Notes in Computer Science, vol. 789, Springer Verlag,1994, pp. 516--542.
  • E. Ritter, D. Pym, and L. Wallen On the intuitionistic force of classical search, Theoretical Computer Science, vol. 232 (2000), pp. 299--333.
  • J. Seldin On the proof theory of the intermediate logic MH, Journal of Symbolic Logic, vol. 51 (1986), no. 3, pp. 626--647.
  • G. Stalmarck Normalization theorems for full first order classical natural deduction, Journal of Symbolic Logic, vol. 56 (1991), no. 1, pp. 129--149.
  • D. van Daalen The language theory of automath, Ph.D. thesis, Eindhoven,1977.