Cut-elimination for weak Grzegorczyk logic Go

DOI10.1007/s11225-012-9432-9zbMath1329.03056OpenAlexW2084145796MaRDI QIDQ2016062

Revantha Ramanayake, Rajeev Goré

Publication date: 19 June 2014

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-012-9432-9

zbMATH Keywords

proof theoryGosyntactic cut-eliminationweak Grzegorczyk logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05)

Related Items (2)

Cut-elimination for provability logic by terminating proof-search: formalised and deconstructed using Coq ⋮ Modal Logics that Bound the Circumference of Transitive Frames

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The modal logic of provability: cut-elimination
• On some proof theoretical properties of the modal logic GL
• Cut elimination for S4C: A case study
• The modal logic of provability. The sequential approach
• Display logic
• Cut-free tableau calculi for some propositional normal modal logics
• The modalized Heyting calculus: a conservative modal extension of the Intuitionistic Logic ★
• On the Proof Theory of the Modal Logic Grz
• A proof of Gentzen's \textit{Hauptsatz} without multicut

This page was built for publication: Cut-elimination for weak Grzegorczyk logic Go