Proof-Theoretic Semantics, Self-Contradiction, and the Format of Deductive Reasoning

From the point of view of proof-theoretic semantics, it is argued that the sequent calculus with introduction rules on the assertion and on the assumption side represents deductive reasoning more appropriately than natural deduction. In taking consequence to be conceptually prior to truth, it can cope with non-well-founded phenomena such as contradictory reasoning. The fact that, in its typed variant, the sequent calculus has an explicit and separable substitution schema in form of the cut rule, is seen as a crucial advantage over natural deduction, where substitution is built into the general framework.

[1]  Lars Hallnäs Partial inductive definitions , 1991 .

[2]  Peter Schroeder-Heister,et al.  The categorical and the hypothetical: a critique of some fundamental assumptions of standard semantics , 2012, Synthese.

[3]  P. Schroeder-Heister Proof-Theoretic versus Model-Theoretic Consequence , 2009 .

[4]  Peter Aczel,et al.  An Introduction to Inductive Definitions , 1977 .

[5]  Peter Schroeder-Heister,et al.  Sequent Calculi and Bidirectional Natural Deduction : On the Proper Basis of Proof-theoretic Semantics , 2009 .

[6]  Neil Tennant Proof and Paradox , 1982 .

[7]  Michal Pelis The Logica yearbook 2008 , 2009 .

[8]  Lars Hallnäs,et al.  A Proof-Theoretic Approach to Logic Programming. II. Programs as Definitions , 1991, J. Log. Comput..

[9]  Peter Schroeder-Heister,et al.  Implications-as-Rules vs. Implications-as-Links: An Alternative Implication-Left Schema for the Sequent Calculus , 2011, J. Philos. Log..

[10]  Hendrik Pieter Barendregt,et al.  Lambda terms for natural deduction, sequent calculus and cut elimination , 2000, J. Funct. Program..

[11]  Jan Ekman,et al.  Propositions in Prepositional Logic Provable Only by Indirect Proofs , 1998, Math. Log. Q..

[12]  Victor W. Marek,et al.  Logic programming revisited , 2001, ACM Trans. Comput. Log..

[13]  D. Prawitz Natural Deduction: A Proof-Theoretical Study , 1965 .

[14]  Lars Hallnäs,et al.  On the Proof-theoretic Foundation of General Definition Theory , 2006, Synthese.

[15]  Michael Dummett,et al.  The logical basis of metaphysics , 1991 .

[16]  Lars Hallnäs,et al.  A Proof-Theoretic Approach to Logic Programming. I. Clauses as Rules , 1990, J. Log. Comput..

[17]  Peter Schroeder-Heister,et al.  Validity Concepts in Proof-theoretic Semantics , 2006, Synthese.