Skip to main content Accessibility help
×
Home
Hostname: page-component-564cf476b6-s5ssh Total loading time: 0.231 Render date: 2021-06-21T17:48:57.364Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": true, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true }

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

Published online by Cambridge University Press:  12 March 2014

René David
Affiliation:
Lama – Equipe De Logique, Université De Chambéry, 73376 Le Bourget Du Lac, France, E-mail: david@univ-savoie.fr
Karim Nour
Affiliation:
Lama – Equipe De Logique, Université De Chambéry, 73376 Le Bourget Du Lac, France, E-mail: nour@univ-savoie.fr
Corresponding

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.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2003

Access options

Get access to the full version of this content by using one of the access options below.

References

[1] Andou, Y., Church-Rosser property of a simple reduction for full first-order classical natural deduction. Annals of Pure and Applied Logic, vol. 119 (2003), pp. 225237.CrossRefGoogle Scholar
[2] Barbanera, F. and Berardi, S., A symmetric lambda calculus for “classical” program extraction, Proceedings of theoretical aspects of computer software, tacs '94 (Hagiya, M. and Mitchell, J.C., editors), Lecture Notes in Computer Science, vol. 789, Springer Verlag, 1994, pp. 495515.CrossRefGoogle Scholar
[3] Bittar, E. T., Strong Normalisation Proofs for Cut-Elimination in Gentzen's Sequent Calculi, Logic, algebra and computer science, vol. 46, Banach Center Publications, 1999, pp. 179225.Google Scholar
[4] Constable, R. and Murthy, C., Finding computational content in classical proofs, Logical frame works (Huet, G. and Plotkin, G., editors), Cambridge University Press, 1991, pp. 341362.CrossRefGoogle Scholar
[5] David, R., Normalization without reducibility, Annals of Pure and Applied Logic, vol. 107 (2001), pp. 121130.CrossRefGoogle Scholar
[6] David, R. and Guillaume, B., Strong normalization of the typed λws-calculus, Accepted in the CSL'03 colloquium.Google Scholar
[7] David, R. and Nour, K., A short proof of the strong normalization of the simply typed λμ-calculus, Schedae Informaticae, vol. 12 (2003), To appear.Google Scholar
[8] de Groote, P., 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. 201205.CrossRefGoogle Scholar
[9] de Groote, P., Strong normalization of classical natural deduction with disjunction, In 5th International Conference on Typed Lambda Calculi and Applications, TLCA '01, Lecture Notes in Computer Science, vol. 2044, Springer Verlag, 2001, pp. 182196.CrossRefGoogle Scholar
[10] Girard, J.-Y., A new constructive logic: classical logic, Mathematical Structures in Computer Science, vol. 1 (1991), pp. 255296.CrossRefGoogle Scholar
[11] Joachimski, F. and Matthes, R., Short proofs of normalization for the simply-typed λ-calculus, permutative conversions and Gödel's T, Archive for Mathematical Logic, vol. 42 (2003), pp. 5987.CrossRefGoogle Scholar
[12] Krivine, J.-L., Classical logic, storage operators and 2nd order lambda-calculus, Annals of Pure and Applied Logic, vol. 68 (1994), pp. 5378.CrossRefGoogle Scholar
[13] Levy, J.J., Reductions correctes et optimales dans le lambda-calcul, Ph.D. thesis, Paris 7, 1978.Google Scholar
[14] Murthy, C.R., An evaluation semantics for classical proofs, Proceedings of the sixth annual IEEE symposium on logic in computer science, 1991, pp. 96107.CrossRefGoogle Scholar
[15] Murthy, C.R., A computational analysis of Girard's translation and LC, Proceedings of the seventh annual IEEE symposium on logic in computer science, 1992, pp. 90101.CrossRefGoogle Scholar
[16] Nour, K. and Saber, K., A semantical proof of the strong normalization theorem of full propositionnal classical natural deduction, Manuscript, 2003.Google Scholar
[17] Parigot, M., λμ-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. 190201.CrossRefGoogle Scholar
[18] Parigot, M., Proofs of strong normalisation for second order classical natural deduction, this Journal, vol. 62 (1997), no. 4, pp. 14611479.Google Scholar
[19] Prawitz, D., Natural deduction. A proof-theoretical study, Almqvist & Wiksell, Stockholm, 1965.Google Scholar
[20] Prawitz, D., Ideas and results in proof-theory, Proceedings of the second Scandinavian logic symposium (Fenstad, J.E., editor), North-Holland, 1971, pp. 237309.Google Scholar
[21] Pym, D. and Ritter, E., On the semantics of classical disjunction. Journal of Pure and Applied Algebra , to appear.Google Scholar
[22] Rehof, N. J. and Sorensen, M. H., The λΔ-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. 516542.CrossRefGoogle Scholar
[23] Ritter, E., Pym, D., and Wallen, L., On the intuitionistic force of classical search. Theoretical Computer Science, vol. 232 (2000), pp. 299333.CrossRefGoogle Scholar
[24] Ritter, E., Proof-terms for classical and intuitionistic resolution, Journal of Logic and Computation, vol. 10 (2000), no. 2, pp. 173207.CrossRefGoogle Scholar
[25] Seldin, J., On the proof theory of the intermediate logic MH, this Journal, vol. 51 (1986), no. 3, pp. 626647.Google Scholar
[26] Stalmarck, G., Normalization theorems for full first order classical natural deduction, this Journal, vol. 56 (1991), no. 1, pp. 129149.Google Scholar
[27] van Daalen, D., The language theory of automath, Ph.D. thesis, Eindhoven, 1977.Google Scholar
18
Cited by

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

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

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

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

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

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

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *