Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-09T13:51:37.462Z Has data issue: false hasContentIssue false
  • English
  • Français

Towards an algorithmic construction of cut-elimination procedures†

Published online by Cambridge University Press:  01 February 2008

AGATA CIABATTONI  and
ALEXANDER LEITSCH
AGATA CIABATTONI
Affiliation:
Institut für Diskrete Mathematik und Geometrie, TU Wien, Austria
ALEXANDER LEITSCH
Affiliation:
Institut für Computersprachen, TU Wien, Austria
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We investigate cut elimination in propositional substructural logics. The problem is to decide whether a given calculus admits (reductive) cut elimination. We show that for commutative single-conclusion sequent calculi containing generalised knotted structural rules and arbitrary logical rules the problem can be decided by resolution-based methods. A general cut-elimination proof for these calculi is also provided.

Information

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 18 , Special Issue 1: in memory of Sauro Tulipani , February 2008 , pp. 81 - 105
Copyright
Copyright © Cambridge University Press2008

References

Avron, A. and Lev, I. (2005) Non-deterministic Multiple-valued Structures. J. of Logic and Computation 15 (3)241–261.Google Scholar
Baaz, M., Ciabattoni, A. and Montagna, F. (2004) Analytic Calculi for Monoidal T-norm Based Logic. Fundamenta Informaticae 59 (4)315–332.Google Scholar
Baaz, M. and Leitsch, A. (2000) Cut-elimination and Redundancy-elimination by Resolution. J. Symb. Comput. 29 (2)149–177.Google Scholar
Basin, D. and Ganzinger, H. (2001) Automated Complexity Analysis Based on Ordered Resolution. Journal of the ACM 48 (1)70–109.Google Scholar
Buss, S. (1998) An Introduction to Proof Theory. Handbook of Proof Theory, Elsevier Science 1–78.Google Scholar
Ciabattoni, A. and Terui, K. (2006) Towards a semantic characterization of cut-elimination. Studia Logica 82 (1)95–119.Google Scholar
Galatos, N. and Ono, H. (2006) Algebraization, parametrized local deduction theorem and interpolation for substructural logics over FL. Studia Logica 83 279–308.CrossRefGoogle Scholar
Gentzen, G. (1935) Untersuchungen über das Logische Schliessen. Math. Zeitschrift 39 176–210, 405–431.Google Scholar
Hori, R.Ono, H. and Schellinx, H. (1994) Extending intuitionistic linear logic with knotted structural rules. Notre Dame Journal of Formal Logic 35 (2)219–242.Google Scholar
Leitsch, A. (1997) The Resolution Calculus, Springer-Verlag.CrossRefGoogle Scholar
Miller, D. and Pimentel, E. (2002) Using Linear Logic to reason about sequent systems. Proceedings of Tableaux'02. Springer-Verlag Lecture Notes in Artificial Intelligence 2381 2–23.Google Scholar
Miller, D. and Pimentel, E. (2005) On the specification of sequent system. Proceedings of LPAR'05. Springer-Verlag Lecture Notes in Computer Science 3835 352–366.Google Scholar
Prijatelj, A. (1996) Bounded Contraction and Gentzen style Formulation of Łukasiewicz Logics. Studia Logica 57 437–456.Google Scholar
Restall, G. (1999) An Introduction to Substructural Logics, Routledge.Google Scholar
Schmidt-Schauss, M. (1988) Implication of clauses is undecidable. Theoretical Computer Science 268 287–296.Google Scholar
Schütte, K. (1960) Beweistheorie, Springer Verlag.Google Scholar
Tait, W. W. (1968) Normal derivability in classical logic. In: The Syntax and Semantics of infinitary Languages. Springer-Verlag Lecture Notes in Mathematics 72 204–236.Google Scholar
van Benthem, J. (1991) Language in Action: Categories, Lambdas and Dynamic Logic, Studies in Logic 130, North-Holland.Google Scholar