On modal systems having arithmetical interpretations

DOI10.2307/2274147MaRDI QIDQ3714054zbMATH OpenOpenAlexFDO

Authors Arnon Avron

Publication date 1984

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2274147

zbMATH Keywords

semanticscut-eliminationprovabilitydisjunction propertysequential calculusmodal logic GLmodal logic Grzfirst-order modal system QGLomitting system

Mathematics Subject Classification ID

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

Recommendations

• On some proof theoretical properties of the modal logic GL
• The predicate modal logic of provability
• A proof theory for the logic of provability in true arithmetic
• scientific article; zbMATH DE number 4197983
• Symbolic Representations of the Post-apartheid University

Cites work

• A modal sequent calculus for a fragment of arithmetic
• Fifty years of self-reference in arithmetic
• Provability interpretations of modal logic

Cited in

(29)

• Interacting explicit evidence systems
• A proof theory for the logic of provability in true arithmetic
• scientific article; zbMATH DE number 2109538 (Why is no real title available?)
• An Arithmetically Complete Predicate Modal Logic
• scientific article; zbMATH DE number 7561320 (Why is no real title available?)
• A terminating intuitionistic calculus
• On arithmetical completeness of the logic of proofs
• scientific article; zbMATH DE number 16407 (Why is no real title available?)
• NON-WELL-FOUNDED PROOFS FOR THE GRZEGORCZYK MODAL LOGIC
• The modal logic of provability: cut-elimination
• Positive modal logic
• Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 12--17, 2023
• Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work)
• Valentini's cut-elimination for provability logic resolved
• A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs
• A proof theoretic tool for first-order modal logic
• On the proof-theory of two formalisations of modal first-order logic
• Symbolic Representations of the Post-apartheid University
• Sequent calculi for intuitionistic Gödel-Löb logic
• Logics of import and export for the implicative conditional
• Explicit provability and constructive semantics
• Kripke Semantics for Basic Sequent Systems
• Modal-epistemic variants of Shapiro's system of epistemic arithmetic
• The bounded proof property via step algebras and step frames
• Cut-free sequent calculi for the provability logic D
• The equivalence of the disjunction and existence properties for modal arithmetic
• Unifying sequent systems for Gödel-Löb provability logic via syntactic transformations
• Maximality in modal logic
• Syntactic cut-elimination for provability logic GL via nested sequents

This page was built for publication: On modal systems having arithmetical interpretations

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