On some proof theoretical properties of the modal logic GL

DOI10.1007/BF01371633MaRDI QIDQ798649zbMATH OpenFDO

Authors Marco Borga

Publication date 1983

Published in Studia Logica (Search for Journal in Brave)

zbMATH Keywords

cut eliminationGLpropositional modal logic

Mathematics Subject Classification ID

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

Recommendations

• On the Proof Theory of the Modal Logic Grz
• Glivenko type theorems for intuitionistic modal logics
• Towards a proof theory of Gödel modal logics
• ON MODAL LOGICS AXIOMATIZING PROVABILITY
• scientific article; zbMATH DE number 3963790
• ON TWO EXTENSIONS OF THE LOGIC OF PROVABILITY GL
• Publication:3495340
• A modal provability logic of explicit and implicit proofs
• On the proof-theory of two formalisations of modal first-order logic
• A systematic proof theory for several modal logics

Cites work

• scientific article; zbMATH DE number 3635994 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• A modal sequent calculus for a fragment of arithmetic
• On the proof theory of the modal logic for arithmetic provability
• Proof theory
• Proof theory and intuitionistic systems
• The modal logic of provability. The sequential approach
• The modal logic of provability: cut-elimination
• Untersuchungen über das logische Schliessen. I

Cited in

(15)

• On absence of finite approximation relative to model completeness in the propositional provability logic
• On the proof-theory of a first-order extension of GL
• Cut-elimination for provability logic by terminating proof-search: formalised and deconstructed using Coq
• scientific article; zbMATH DE number 5241978 (Why is no real title available?)
• Cut elimination for GLS using the terminability of its regress process
• Symbolic Representations of the Post-apartheid University
• The persistence principle over weak interpretability logic
• Valentini's cut-elimination for provability logic resolved
• On the absence of finite approximation relative to model completeness in propositional provability logic
• On modal systems having arithmetical interpretations
• The modal logic of provability: cut-elimination
• Cut-elimination for weak Grzegorczyk logic Go
• Syntactical results on the arithmetical completeness of modal logic
• A Syntactic Proof of Cut‐Elimination For GL_lin
• A proof theory for the logic of provability in true arithmetic

This page was built for publication: On some proof theoretical properties of the modal logic GL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798649)