The modal logic of provability. The sequential approach

DOI10.1007/BF00293433zbMATH Open0523.03014OpenAlexW2034070758MaRDI QIDQ1056745FDOQ1056745

Authors: Giovanni Sambin, Silvio Valentini 

Publication date: 1982

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00293433

zbMATH Keywords

fixed point theoremsemanticsmodal logicarithmeticcut-eliminationprovabilityarithmetical completeness theoremsequentsproof-theory

Mathematics Subject Classification ID

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

Cites Work

• Provability interpretations of modal logic
• Solution of a problem of Leon Henkin
• The modal logic of provability: cut-elimination
• Title not available (Why is that?)
• Title not available (Why is that?)
• An effective fixed-point theorem in intuitionistic diagonalizable algebras. (The algebraization of the theories which express Theor. IX.)
• The uniqueness of the fixed-point in every diagonalizable algebra. (The algebraization of the theories which express Theor. VIII.)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Intuitionistic diagonalizable algebras
• THE MODAL LOGIC OF CONSISTENCY ASSERTIONS OF PEANO ARITHMETIC
• Extremely undecidable sentences

Cited In (35)

• A proof theory for the logic of provability in true arithmetic
• Provability in finite subtheories of PA and relative interpretability: a modal investigation
• Circular proofs for the Gödel-Löb provability logic
• Title not available (Why is that?)
• The fixed point property in modal logic
• Cut elimination for GLS using the terminability of its regress process
• The Method of Tree-Hypersequents for Modal Propositional Logic
• Cut-elimination for weak Grzegorczyk logic Go
• A formalization of Sambins's normalization for GL
• Proof-theoretic results of common sense modal predicate calculi
• The modal logic of provability: cut-elimination
• On some proof theoretical properties of the modal logic GL
• Proof analysis in modal logic
• Formal topological characterizations of various continuous domains
• Cut-elimination for provability logic by terminating proof-search: formalised and deconstructed using Coq
• 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03
• Uniform interpolation and propositional quantifiers in modal logics
• Intuitionistic Decision Procedures Since Gentzen
• Provability multilattice logic
• 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
• On the proof-theory of two formalisations of modal first-order logic
• Polynomially and superexponentially shorter proofs in fragments of arithmetic
• Interpolation properties for Sacchetti's logics
• Modal interpolation via nested sequents
• Provability: The emergence of a mathematical modality
• Kripke Semantics for Basic Sequent Systems
• The bounded proof property via step algebras and step frames
• An epistemic logic for becoming informed
• Modal tableau calculi and interpolation
• The Henkin sentence
• Syntactical results on the arithmetical completeness of modal logic
• A realization theorem for the Gödel-Löb provability logic
• Note on some fixed point constructions in provability logic
• Effectively constructible fixed points in Sacchetti's modal logics of provability

This page was built for publication: The modal logic of provability. The sequential approach

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