Revantha Ramanayake Cut - elimination for Weak Grzegorczyk Logic Go
نویسندگان
چکیده
We present a syntactic proof of cut-elimination for weak Grzegorczyk logic Go. The logic has a syntactically similar axiomatisation to Gödel–Löb logic GL (provability logic) and Grzegorczyk’s logic Grz. Semantically, GL can be viewed as the irreflexive counterpart of Go, and Grz can be viewed as the reflexive counterpart of Go. Although proofs of syntactic cut-elimination for GL and Grz have appeared in the literature, this is the first proof of syntactic cut-elimination for Go. The proof is technically interesting, requiring a deeper analysis of the derivation structures than the proofs for GL and Grz. New transformations generalising the transformations for GL and Grz are developed here.
منابع مشابه
Bunched Hypersequent Calculi for Distributive Substructural Logics
We introduce a new proof-theoretic framework which enhances the expressive power of bunched sequents by extending them with a hypersequent structure. A general cut-elimination theorem that applies to bunched hypersequent calculi satisfying general rule conditions is then proved. We adapt the methods of transforming axioms into rules to provide cutfree bunched hypersequent calculi for a large cl...
متن کاملOn Cut-elimination for Provability Logic GL
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLS for the provability logic GL. The sequents in GLS were built from sets, as opposed to multisets, thus permitting implicit contractions. Recently it has been claimed that Valentini’s transformations to eliminate cut do not terminate when applied to GLS in a multiset-sequent setting with a rule of contrac...
متن کاملValentini's cut-elimination for provability logic resolved
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript v for “Valentini”. The sequents in GLSV were built from sets, as opposed to multisets, thus avoiding an explicit contraction rule. From a syntactic point of view, it is more satisfying and formal to explicitly identify the applications of t...
متن کاملStructural Extensions of Display Calculi: A General Recipe
We present a systematic procedure for constructing cut-free display calculi for axiomatic extensions of a logic via structural rule extensions. The sufficient conditions for the procedure are given in terms of (purely syntactic) abstract properties of the display calculus and thus the method applies to large classes of calculi and logics. As a case study, we present cut-free calculi for extensi...
متن کامل