On the proof theory of the modal logic for arithmetic provability

DOI10.2307/2273755MaRDI QIDQ3914957zbMATH OpenOpenAlexFDO

Authors Daniel M. Leivant

Publication date 1981

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

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

zbMATH Keywords

cut eliminationinterpolation theoremprovabilitycut free derivationsquantifier extensions

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3261581 (Why is no real title available?)
• scientific article; zbMATH DE number 3274715 (Why is no real title available?)
• Failures of the interpolation lemma in quantified modal logic
• Provability interpretations of modal logic
• Reflection principles and iterated consistency assertions
• Solution of a problem of Leon Henkin

Cited in

(17)

• Circular proofs for the Gödel-Löb provability logic
• scientific article; zbMATH DE number 7243672 (Why is no real title available?)
• The closed fragment of IL is PSPACE hard
• A purely syntactic and cut-free sequent calculus for the modal logic of provability
• A cut-free sequential system for the propositional modal logic of finite chains
• The modal logic of provability: cut-elimination
• On some proof theoretical properties of the modal logic GL
• Proof analysis in modal logic
• Proof-theoretic results of common sense modal predicate calculi
• 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03
• The modal logic of provability. The sequential approach
• Valentini's cut-elimination for provability logic resolved
• Provability multilattice logic
• On the proof-theory of two formalisations of modal first-order logic
• Machine Checking Proof Theory: An Application of Logic to Logic
• Modal tableau calculi and interpolation
• A realization theorem for the Gödel-Löb provability logic

This page was built for publication: On the proof theory of the modal logic for arithmetic provability

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