On some proof theoretical properties of the modal logic GL

DOI10.1007/BF01371633zbMATH Open0547.03016MaRDI QIDQ798649FDOQ798649

Authors: Marco Borga 

Publication date: 1983

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

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

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)

Cites Work

• Untersuchungen über das logische Schliessen. I
• Title not available (Why is that?)
• The modal logic of provability. The sequential approach
• The modal logic of provability: cut-elimination
• Proof theory
• On the proof theory of the modal logic for arithmetic provability
• Title not available (Why is that?)
• A modal sequent calculus for a fragment of arithmetic
• Proof theory and intuitionistic systems

Cited In (15)

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

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)