A Local System for Intuitionistic Logic

This paper presents systems for first-order intuitionistic logic and several of its extensions in which all the propositional rules are local, in the sense that, in applying the rules of the system, one needs only a fixed amount of information about the logical expressions involved. The main source of non-locality is the contraction rules. We show that the contraction rules can be restricted to the atomic ones, provided we employ deep-inference, i.e., to allow rules to apply anywhere inside logical expressions. We further show that the use of deep inference allows for modular extensions of intuitionistic logic to Dummett's intermediate logic LC, Godel logic and classical logic. We present the systems in the calculus of structures, a proof theoretic formalism which supports deep-inference. Cut elimination for these systems are proved indirectly by simulating the cut-free sequent systems, or the hypersequent systems in the cases of Dummett's LC and Godel logic, in the cut free systems in the calculus of structures.

[1]  Rajeev Goré,et al.  Substructural Logics on Display , 1998, Log. J. IGPL.

[2]  Roy Dyckhoff,et al.  Contraction-free sequent calculi for intuitionistic logic , 1992, Journal of Symbolic Logic.

[3]  Lev Gordeev,et al.  Basic proof theory , 1998 .

[4]  Kai Brünnler.  Two Restrictions on Contraction , 2003, Log. J. IGPL.

[5]  Jiirg Hudelmaier,et al.  Bounds for cut elimination in intuitionistic propositional logic , 1992, Arch. Math. Log..

[6]  Yves Guiraud.  The three dimensions of proofs , 2006, Ann. Pure Appl. Log..

[7]  Matthias Baaz,et al.  A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic , 2002, TABLEAUX.

[8]  Peter W. O'Hearn,et al.  The Logic of Bunched Implications , 1999, Bulletin of Symbolic Logic.

[9]  Alwen Tiu,et al.  A Local System for Classical Logic , 2001, LPAR.

[10]  Ozan Kahramanogullari.  Reducing Nondeterminism in the Calculus of Structures , 2006, LPAR.

[11]  Charles A. Stewart,et al.  A Systematic Proof Theory for Several Modal Logics , 2004, Advances in Modal Logic.

[12]  Lutz Straßburger,et al.  Linear logic and noncommutativity in the calculus of structures , 2003 .

[13]  H. Reichel,et al.  Deep Inference and Symmetry in Classical Proofs , 2003 .

[14]  Alessio Guglielmi,et al.  A system of interaction and structure , 1999, TOCL.

[15]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[16]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[17]  Satoko Titani,et al.  Intuitionistic fuzzy logic and intuitionistic fuzzy set theory , 1984, Journal of Symbolic Logic.

[18]  Didier Galmiche,et al.  Labelled proof systems for intuitionistic provability , 2000 .

[19]  Arnon Avron,et al.  Hypersequents, logical consequence and intermediate logics for concurrency , 1991, Annals of Mathematics and Artificial Intelligence.

[20]  Ozan Kahramano ˘ gullari.  Reducing Nondeterminism in the Calculus of Structures , 2006 .

[21]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[22]  Michael Dummett,et al.  A propositional calculus with denumerable matrix , 1959, Journal of Symbolic Logic (JSL).

[23]  Kinley,et al.  Classical categories and deep inference , 2005 .