Which structural rules admit cut elimination? An algebraic criterion

Kazushige Terui
Source: J. Symbolic Logic Volume 72, Issue 3 (2007), 738-754.

Abstract

Consider a general class of structural inference rules such as exchange, weakening, contraction and their generalizations. Among them, some are harmless but others do harm to cut elimination. Hence it is natural to ask under which condition cut elimination is preserved when a set of structural rules is added to a structure-free logic. The aim of this work is to give such a condition by using algebraic semantics.

We consider full Lambek calculus (FL), i.e., intuitionistic logic without any structural rules, as our basic framework. Residuated lattices are the algebraic structures corresponding to FL. In this setting, we introduce a criterion, called the propagation property, that can be stated both in syntactic and algebraic terminologies. We then show that, for any set ℛ of structural rules, the cut elimination theorem holds for FL enriched with ℛ if and only if ℛ satisfies the propagation property.

As an application, we show that any set ℛ of structural rules can be “completed" into another set ℛ*, so that the cut elimination theorem holds for FL enriched with ℛ*, while the provability remains the same.

First Page:
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.

Permanent link to this document: http://projecteuclid.org/euclid.jsl/1191333839
Digital Object Identifier: doi:10.2178/jsl/1191333839
Mathematical Reviews number (MathSciNet): MR2354898
Zentralblatt MATH identifier: 1128.03048

References

V. M. Abrusci, Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic, Journal of Symbolic Logic, vol. 56 (1991), pp. 1403--1451.
Mathematical Reviews (MathSciNet): MR1136467
Digital Object Identifier: doi:10.2307/2275485
Project Euclid: euclid.jsl/1183743825
Zentralblatt MATH: 0746.03044
A. Avron and I. Lev, Canonical propositional Gentzen-type systems, IJCAR 2001 (Rajeev Goré, Alexander Leitsch, and Tobias Nipkow, editors), Lecture Notes in Artificial Intelligence, vol. 2083, Springer, 2001, pp. 529--543.
Mathematical Reviews (MathSciNet): MR2049540
Zentralblatt MATH: 0988.03011
Digital Object Identifier: doi:10.1007/3-540-45744-5_45
F. Belardinelli, H. Ono, and P. Jipsen, Algebraic aspects of cut elimination, Studia Logica, vol. 68 (2001), pp. 1--32.
Mathematical Reviews (MathSciNet): MR2080239
Digital Object Identifier: doi:10.1023/B:STUD.0000037127.15182.2a
Zentralblatt MATH: 1064.03014
J. van Benthem, Language in Action: Categories, Lambdas and Dynamic Logic, (Studies in Logic 130), North-Holland, Amsterdam, 1991.
Mathematical Reviews (MathSciNet): MR1102016
A. Ciabattoni, Automated generation of analytic calculi for logics with linearity, CSL 2004 (Jerzy Marcinkowski and Andrzej Tarlecki, editors), Lecture Notes in Computer Science, vol. 3210, Springer, 2004, pp. 503--517.
Mathematical Reviews (MathSciNet): MR2141744
Zentralblatt MATH: 02197075
A. Ciabattoni and K. Terui, Modular cut-elimination: Finding proofs or counterexamples, LPAR 2006 (Miki Hermann and Andrei Voronkov, editors), Lecture Notes in Artificial Intelligence, vol. 4246, Springer, 2006, pp. 135--149.
Mathematical Reviews (MathSciNet): MR2312870
Digital Object Identifier: doi:10.1007/11916277_10
Zentralblatt MATH: 1165.03344
--------, Towards a semantic characterization of cut-elimination, Studia Logica, vol. 82 (2006), pp. 95--119.
Mathematical Reviews (MathSciNet): MR2205040
Digital Object Identifier: doi:10.1007/s11225-006-6607-2
Zentralblatt MATH: 1105.03057
K. Došen and P. Schroeder-Heister (editors), Substructural Logics, Oxford University Press, 1993.
Mathematical Reviews (MathSciNet): MR1283190
J.-Y. Girard, Linear logic, Theoretical Computer Science, vol. 50 (1987), pp. 1--102.
Mathematical Reviews (MathSciNet): MR899269
Digital Object Identifier: doi:10.1016/0304-3975(87)90045-4
--------, Linear logic: Its syntax and semantics, Advances in Linear Logic (J.-Y. Girard, Y. Lafont, and L. Regnier, editors), Cambridge University Press, 1995, pp. 1--42.
Mathematical Reviews (MathSciNet): MR1356006
Zentralblatt MATH: 0828.03003
--------, On the meaning of logical rules I: Syntax vs. semantics, Computational Logic (U. Berger and H. Schwichtenberg, editors), Heidelberg Springer-Verlag, 1999, pp. 215--272.
R. Hori, H. Ono, and H. Schellinx, Extending intuitionistic linear logic with knotted structural rules, Notre-Dame Journal of Formal Logic, vol. 35 (1994), no. 2, pp. 219--242.
Mathematical Reviews (MathSciNet): MR1295560
Digital Object Identifier: doi:10.1305/ndjfl/1094061862
Project Euclid: euclid.ndjfl/1094061862
Zentralblatt MATH: 0812.03008
J. Jipsen and C. Tsinakis, A survey of residuated lattices, Ordered Algebraic Structures (J. Martinez, editor), Kluwer Academic Publishes, 2002, pp. 19--56.
Mathematical Reviews (MathSciNet): MR2083033
Zentralblatt MATH: 1070.06005
N. Kamide, Substructural logics with mingle, Journal of Logic, Language and Information, vol. 11 (2002), no. 2, pp. 227--249.
Mathematical Reviews (MathSciNet): MR1885232
Digital Object Identifier: doi:10.1023/A:1017586008091
Zentralblatt MATH: 1003.03019
D. Miller and E. Pimentel, Using linear logic to reason about sequent systems, Tableaux 2002 (Uwe Egly and Christian G. Fermüller, editors), Lecture Notes in Computer Science, vol. 2381, Springer, 2002, pp. 2--23.
M. Ohnishi and K. Matsumoto, A system for strict implication, Annals of the Japan Association for Philosophy of Science, vol. 2 (1964), pp. 183--188.
Mathematical Reviews (MathSciNet): MR169769
M. Okada, Phase semantics for higher order completeness, cut-elimination and normalization proofs (Extended Abstract), Electronic Notes in Theoretical Computer Science\textnormal, vol.3, a Special Issue on the Linear Logic'96, Tokyo Meeting (J.-Y. Girard, M. Okada, and A. Scedrov, editors), 1996.
Mathematical Reviews (MathSciNet): MR1488177
Zentralblatt MATH: 0908.03013
--------, Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic, Theoretical Computer Science, vol. 227 (1999), pp. 333--396.
Mathematical Reviews (MathSciNet): MR1716761
Digital Object Identifier: doi:10.1016/S0304-3975(99)00058-4
Zentralblatt MATH: 0951.03058
--------, A uniform semantic proof for cut-elimination and completeness of various first and higher order logics, Theoretical Computer Science, vol. 281 (2002), pp. 471--498.
Mathematical Reviews (MathSciNet): MR1909585
Digital Object Identifier: doi:10.1016/S0304-3975(02)00024-5
Zentralblatt MATH: 1048.03042
M. Okada and K. Terui, The finite model property for various fragments of intuitionistic linear logic, Journal of Symbolic Logic, vol. 64 (1999), no. 2, pp. 790--802.
Mathematical Reviews (MathSciNet): MR1777787
Digital Object Identifier: doi:10.2307/2586501
Project Euclid: euclid.jsl/1183745810
Zentralblatt MATH: 0930.03021
H. Ono, Structural rules and a logical hierarchy, Mathematical Logic (P. P. Petkov, editor), Plenum Press, 1990, pp. 95--104.
Mathematical Reviews (MathSciNet): MR1083989
Zentralblatt MATH: 0790.03007
--------, Semantics for substructural logics, Substructural Logics (K. Došen and P. Schroeder-Heister, editors), Oxford University Press, 1994, pp. 259--291.
Mathematical Reviews (MathSciNet): MR1283200
--------, Substructural logics and residuated lattices --- An introduction, Trends in Logic, vol. 20 (2003), pp. 177--212.
Zentralblatt MATH: 1048.03018
G. Restall, An Introduction to Substructural Logics, Routledge, London, 1999.
A. S. Troelstra, Lectures on Linear Logic, CSLI Lecture Notes 29, Center for the Study of Language and Information, Stanford, California, 1992.
Mathematical Reviews (MathSciNet): MR1163373
Zentralblatt MATH: 0942.03535
A. Zamansky and A. Avron, Canonical Gentzen-type calculi with $(n,k)$-ary quantifiers, IJCAR 2006 (Ulrich Furbach and Natarajan Shankar, editors), Lecture Notes in Artificial Intelligence, vol. 4130, Springer, 2006, pp. 251--265.
Mathematical Reviews (MathSciNet): MR2354688
Digital Object Identifier: doi:10.1007/11814771_22
Zentralblatt MATH: 05528291
--------, Cut-elimination and quantification, Studia Logica, vol. 82 (2006), pp. 157--176.
Mathematical Reviews (MathSciNet): MR2205043
Digital Object Identifier: doi:10.1007/s11225-006-6611-6
Zentralblatt MATH: 1097.03050