Abstract
We develop a general method for deriving natural deduction rules from the truth table for a connective. The method applies to both constructive and classical logic. This implies we can derive “constructively valid” rules for any classical connective. We show this constructive validity by giving a general Kripke semantics, that is shown to be sound and complete for the constructive rules. For the well-known connectives (\(\vee \), \(\wedge \), \(\rightarrow \), \(\lnot \)) the constructive rules we derive are equivalent to the natural deduction rules we know from Gentzen and Prawitz. However, they have a different shape, because we want all our rules to have a standard “format”, to make it easier to define the notions of cut and to study proof reductions. In style they are close to the “general elimination rules” studied by Von Plato [13] and others. The rules also shed some new light on the classical connectives: e.g. the classical rules we derive for \(\rightarrow \) allow to prove Peirce’s law. Our method also allows to derive rules for connectives that are usually not treated in natural deduction textbooks, like the “if-then-else”, whose truth table is clear but whose constructive deduction rules are not. We prove that ”if-then-else”, in combination with \(\bot \) and \(\top \), is functionally complete (all other constructive connectives can be defined from it). We define the notion of cut, generally for any constructive connective and we describe the process of “cut-elimination”.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ariola, Z.M., Herbelin, H.: Minimal classical logic and control operators. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 871–885. Springer, Heidelberg (2003). doi:10.1007/3-540-45061-0_68
Curien, P.-L., Herbelin, H.: The duality of computation. In: ICFP, pp. 233–243 (2000)
Dyckhoff, R.: Some remarks on proof-theoretic semantics. In: Piecha, T., Schroeder-Heister, P. (eds.) Advances in Proof-Theoretic Semantics, vol. 43, pp. 79–93. Springer, Heidelberg (2016)
Francez, N., Dyckhoff, R.: A note on harmony. J. Philos. Logic 41(3), 613–628 (2012)
Geuvers, H., Hurkens, T.: Deriving natural deduction rules from truth tables (Extended version). Technical report (2016). http://www.cs.ru.nl/~ herman/PUBS/NatDedTruthTables_Extended.pdf
Milne, P.: Inversion principles and introduction rules. In: Dag Prawitz on Proofs and Meaning, Outstanding Contributions to Logic, vol. 7, pp. 189–224 (2015)
Negri, S., von Plato, J.: Structural Proof Theory. Cambridge University Press, Cambridge (2001)
Parigot, M.: \({\lambda }{\mu }\)-calculus: an algorithmic interpretation of classical natural deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol. 624, pp. 190–201. Springer, Heidelberg (1992). doi:10.1007/BFb0013061
Prawitz, D.: Ideas and results in proof theory. In: Fenstad, J., (ed.) 2nd Scandinavian Logic Symposium, North-Holland, pp. 237–309 (1971)
Schroeder-Heister, P.: A natural extension of natural deduction. J. Symb. Log. 49(4), 1284–1300 (1984)
Troelstra, A.S., van Dalen, D.: Constructivism in Mathematics, vol. 1. Elsevier, Amsterdam (1988)
van Dalen, D.: Logic and Structure. Universitext, 3rd edn. Springer, London (1994)
von Plato, J.: Natural deduction with general elimination rules. Arch. Math. Log. 40(7), 541–567 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer-Verlag GmbH Germany
About this paper
Cite this paper
Geuvers, H., Hurkens, T. (2017). Deriving Natural Deduction Rules from Truth Tables. In: Ghosh, S., Prasad, S. (eds) Logic and Its Applications. ICLA 2017. Lecture Notes in Computer Science(), vol 10119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-54069-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-662-54069-5_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-54068-8
Online ISBN: 978-3-662-54069-5
eBook Packages: Computer ScienceComputer Science (R0)