Skip to main content
×
Home
    • Aa
    • Aa

VALENTINI’S CUT-ELIMINATION FOR PROVABILITY LOGIC RESOLVED

  • RAJEEV GORÉ (a1) and REVANTHA RAMANAYAKE (a2)
Abstract

Valentini (1983) has presented a proof of cut-elimination for provability logic GL for a sequent calculus using sequents built from sets as opposed to multisets, thus avoiding an explicit contraction rule. From a formal point of view, it is more syntactic and satisfying to explicitly identify the applications of the contraction rule that are ‘hidden’ in proofs of cut-elimination for such sequent calculi. There is often an underlying assumption that the move to a proof of cut-elimination for sequents built from multisets is straightforward. Recently, however, it has been claimed that Valentini’s arguments to eliminate cut do not terminate when applied to a multiset formulation of the calculus with an explicit rule of contraction. The claim has led to much confusion and various authors have sought new proofs of cut-elimination for GL in a multiset setting.

Here we refute this claim by placing Valentini’s arguments in a formal setting and proving cut-elimination for sequents built from multisets. The use of sequents built from multisets enables us to accurately account for the interplay between the weakening and contraction rules. Furthermore, Valentini’s original proof relies on a novel induction parameter called “width” which is computed ‘globally’. It is difficult to verify the correctness of his induction argument based on “width.” In our formulation however, verification of the induction argument is straightforward. Finally, the multiset setting also introduces a new complication in the case of contractions above cut when the cut-formula is boxed. We deal with this using a new transformation based on Valentini’s original arguments.

Finally, we discuss the possibility of adapting this cut-elimination procedure to other logics axiomatizable by formulae of a syntactically similar form to the GL axiom.

Copyright
Corresponding author
*LOGIC AND COMPUTATION GROUP, RESEARCH SCHOOL OF COMPUTER SCIENCE, THE AUSTRALIAN NATIONAL UNIVERSITY, CANBERRA, ACT 0200, AUSTRALIA. E-mail: rajeev.gore@anu.edu.au
CNRS LIX, ÉCOLE POLYTECHNIQUE, 91128 PALAISEAU, FRANCE. E-mail: revantha@lix.polytechnique.fr
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

N. D Belnap Jr. (1982). Display logic. Journal of Philosophical Logic, 11(4), 375417.

K. Bimbó (2007). , , LK, and cutfree proofs. Journal of Philosophical Logic, 36(5), 557570.

M. Borga (1983). On some proof theoretical properties of the modal logic GL. Studia Logica: An International Journal for Symbolic Logic, 42(4), 453459.

M. Borga , & P. Gentilini (1986). On the proof theory of the modal logic Grz. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 32(2), 145148.

M. Borisavljević , K. Došen , & Z. Petrić (2000). On permuting cut with contraction. Mathematical Structures in Computer Science, 10(2), 99136. The Lambek Festschrift: mathematical structures in computer science (Montreal, QC, 1997).

S. Demri , & R. Goré (2002). Theoremhood-preserving maps characterizing cut elimination for modal provability logics. Journal of Logic and Computation, 12(5), 861884.

R. Goré (1999). Tableau methods for modal and temporal logics. In Handbook of Tableau Methods. Dordrecht, The Netherlands: Kluwer Academic Publishers, pp. 297396.

R. Goré , W. Heinle , & A. Heuerding (1997). Relations between propositional normal modal logics: An overview. Journal of Logic and Computation, 7(5), 649658.

A. Guglielmi (2007). A system of interaction and structure. ACM Transactions on Computational Logic, 8(1), Art. 1, 64.

S. Negri (2005). Proof analysis in modal logic. Journal of Philosophical Logic, 34(5–6), 507544.

G. Sambin , & S. Valentini (1982). The modal logic of provability. The sequential approach. Journal of Philosophical Logic, 11(3), 311342.

R. M Solovay . (1976). Provability interpretations of modal logic. Israel Journal of Mathematics, 25(3–4), 287304.

S. Valentini (1983). The modal logic of provability: Cut-elimination. Journal of Philosophical Logic, 12(4), 471476.

S. Valentini (1986). A syntactic proof of cut-elimination for GLlin. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 32(2), 137144.

J. von Plato (2001). A proof of Gentzen’s Hauptsatz without multicut. Archive for Mathematical Logic, 40(1), 918.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Review of Symbolic Logic
  • ISSN: 1755-0203
  • EISSN: 1755-0211
  • URL: /core/journals/review-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 6 *
Loading metrics...

Abstract views

Total abstract views: 155 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 29th June 2017. This data will be updated every 24 hours.