Commuting Conversions vs. the Standard Conversions of the “Good” Connectives
- 68 Downloads
Commuting conversions were introduced in the natural deduction calculus as ad hoc devices for the purpose of guaranteeing the subformula property in normal proofs. In a well known book, Jean-Yves Girard commented harshly on these conversions, saying that ‘one tends to think that natural deduction should be modified to correct such atrocities.’ We present an embedding of the intuitionistic predicate calculus into a second-order predicative system for which there is no need for commuting conversions. Furthermore, we show that the redex and the conversum of a commuting conversion of the original calculus translate into equivalent derivations by means of a series of bidirectional applications of standard conversions.
KeywordsNatural deduction commuting conversions predicative quantifiers
Unable to display preview. Download preview PDF.
- 2.Girard, J.-Y., Y. Lafont, and P. Taylor, Proofs and Types, Cambridge University Press, 1989.Google Scholar
- 3.Prawitz, D., Natural Deduction, Almkvist & Wiksell, Stockholm, 1965. Reprinted, with a new preface, in Dover Publications, 2006.Google Scholar
- 4.Sandqvist, T., ‘A Note on Definability of Logical Operators in Second-order Logic’, Unpublished manuscript, 2008.Google Scholar
- 5.Troelstra, A., and H. Schwichtenberg, Basic Proof Theory, Cambridge University Press, 1996.Google Scholar