scientific article; zbMATH DE number 3635994
From MaRDI portal
Publication:4196401
MonographDecidabilityPeano ArithmeticModal LogicTextbookGödel Proof PredicateNormal SystemUnprovability of Consistency
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Relative consistency and interpretations (03F25)
Cited in
(72)- Cut-elimination for provability logic by terminating proof-search: formalised and deconstructed using Coq
- Modal Platonism: an easy way to avoid ontologial commitment to abstract entities
- On inclusions between quantified provability logics
- On the nonexistence of certain normal forms in the logic of provability
- A formalization of Sambins's normalization for GL
- A translation from the modal logic of provability into K4
- The fixed point and the Craig interpolation properties for sublogics of \textbf{IL}
- European Summer Meeting of the Association for Symbolic Logic
- Reflecting in epistemic arithmetic
- One-step modal logics, intuitionistic and classical. II
- Syntactical models and fixed points for the basic logic of proofs
- Marginalia on a theorem of Woodin
- The scope of Gödel's first incompleteness theorem
- Self-reference and incompleteness in a non-monotonic setting
- On the relation between default and autoepistemic logic
- Languages with self-reference. II: Knowledge, belief, and modality
- A quantified logic of evidence
- Rosser and Mostowski sentences
- A propositional logic with explicit fixed points
- Algebraic and relational semantics for tense logics
- The logic of linear tolerance
- Predicate provability logic with non-modalized quantifiers
- The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic
- A cut-free sequential system for the propositional modal logic of finite chains
- Interpolation properties for provability logics GL and GLP
- Provability: The emergence of a mathematical modality
- Logic of proofs
- Provability, truth, and modal logic
- Hyperdiagonalizable algebras
- European Summer Meeting of the Association for Symbolic Logic
- Branching versus linear logics yet again
- Non-monotonic logic. I
- On superintuitionistic logics as fragments of proof logic extensions
- Topological interpretations of provability logic
- Decidable and enumerable predicate logics of provability
- Modal operators with probabilistic interpretations. I
- Explicit provability and constructive semantics
- Incompleteness and the Barcan formula
- Graded modalities. I
- A generalized notion of weak interpretability and the corresponding modal logic
- Models for normal intuitionistic modal logics
- Representing the knowledge of Turing machines
- Basic Propositional Calculus I
- Finite Kripke models and predicate logics of provability
- The modal logic of provability. The sequential approach
- Models for stronger normal intuitionistic modal logics
- Modal tableau calculi and interpolation
- Magari and \(\Delta\)-pseudo-Boolean algebras
- Definability and commonsense reasoning
- Omega-consistency and the diamond
- Generic generalized Rosser fixed points
- Provability in finite subtheories of PA and relative interpretability: a modal investigation
- The modal logic of provability: cut-elimination
- Provability logic without Craig's interpolation property
- Modal logic for other-world agnostics: Neutrality and Halldén incompleteness
- Fixed points in propositional nonmonotonic logic
- On first-order theories with provability operator
- The logic of arithmetical hierarchy
- On some proof theoretical properties of the modal logic GL
- Fixed points and unfounded chains
- An algebraic study of well-foundedness
- Note on some fixed point constructions in provability logic
- Mathematical modal logic: A view of its evolution
- Quantified Quinean \(S5\)
- Belief closure: A semantics of common knowledge for modal propositional logic
- Uniform self-reference
- Varieties of complex algebras
- The fixed point property in modal logic
- A proof theory for the logic of provability in true arithmetic
- A modal sequent calculus for a fragment of arithmetic
- Explicit fixed points in interpretability logic
- The omega-rule interpretation of transfinite provability logic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4196401)
