scientific article; zbMATH DE number 1170091
From MaRDI portal
Publication:4397069
zbMath0891.03004MaRDI QIDQ4397069
Publication date: 30 June 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
modal logicconsistencypossibilityprovabilityPeano Arithmeticprovability logicGödel's incompleteness theoremsnecessityself-referential sentences
Modal logic (including the logic of norms) (03B45) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40)
Related Items (only showing first 100 items - show all)
An Arithmetical Interpretation of Verification and Intuitionistic Knowledge ⋮ Realization of Intuitionistic Logic by Proof Polynomials ⋮ The Henkin Sentence ⋮ The mathematical significance of proof theory ⋮ THE MODAL LOGIC OF SET-THEORETIC POTENTIALISM AND THE POTENTIALIST MAXIMALITY PRINCIPLES ⋮ MANY-VALUED LOGIC OF INFORMAL PROVABILITY: A NON-DETERMINISTIC STRATEGY ⋮ A note on Barcan formula ⋮ Provability multilattice logic ⋮ Arithmetical completeness theorems for monotonic modal logics ⋮ A Sound Interpretation of Leśniewski's Epsilon in Modal Logic KTB ⋮ An Arithmetically Complete Predicate Modal Logic ⋮ Modal completeness of sublogics of the interpretability logic IL ⋮ Partitioning Kripke frames of finite height ⋮ Extensions of Solovay's system \(\mathbf{S}\) without independent sets of axioms ⋮ Mechanising Gödel-Löb provability logic in HOL light ⋮ Some observations on the FGH theorem ⋮ A Qualitative Theory of Cognitive Attitudes and their Change ⋮ A CLASSICAL MODAL THEORY OF LAWLESS SEQUENCES ⋮ ANOTHER LOOK AT THE SECOND INCOMPLETENESS THEOREM ⋮ DISJUNCTION AND EXISTENCE PROPERTIES IN MODAL ARITHMETIC ⋮ AN ESCAPE FROM VARDANYAN’S THEOREM ⋮ PREDICATIVITY THROUGH TRANSFINITE REFLECTION ⋮ The fixed point and the Craig interpolation properties for sublogics of \textbf{IL} ⋮ CONSERVATION THEOREMS ON SEMI-CLASSICAL ARITHMETIC ⋮ Logical analysis of emotions in text from natural language ⋮ Reflection calculus and conservativity spectra ⋮ Labelling ideality and subideality ⋮ Derived topologies on ordinals and stationary reflection ⋮ Multimodal Separation Logic for Reasoning About Operational Semantics ⋮ ARITHMETICAL INTERPRETATIONS AND KRIPKE FRAMES OF PREDICATE MODAL LOGIC OF PROVABILITY ⋮ SELF-REFERENCE IN ARITHMETIC I ⋮ Which modal logic is the right one? ⋮ Rules and arithmetics ⋮ An open formalism against incompleteness ⋮ The modal logic of forcing ⋮ Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic ⋮ Logic of proofs and provability ⋮ Quantum logic, Hilbert space, revision theory ⋮ Symmetric Logic of Proofs ⋮ A PARAMETRIC, RESOURCE-BOUNDED GENERALIZATION OF LÖB’S THEOREM, AND A ROBUST COOPERATION CRITERION FOR OPEN-SOURCE GAME THEORY ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ Unnamed Item ⋮ Worms, gaps, and hydras ⋮ Unnamed Item ⋮ KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS ⋮ Paraconsistent conjectural deduction based on logical entropy measures I: C-systems as non-standard inference framework ⋮ GÖDEL’S SECOND INCOMPLETENESS THEOREM: HOW IT IS DERIVED AND WHAT IT DELIVERS ⋮ FINDING THE LIMIT OF INCOMPLETENESS I ⋮ Formal verification of multi-agent systems behaviour emerging from cognitive task analysis ⋮ COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS ⋮ Some Formal Semantics for Epistemic Modesty ⋮ A NOTE ON DERIVABILITY CONDITIONS ⋮ Constructive Modalities with Provability Smack ⋮ Topological Interpretations of Provability Logic ⋮ A Non-Standard Kripke Semantics for the Minimal Deontic Logic ⋮ Modal Logics that Bound the Circumference of Transitive Frames ⋮ Modal Logics of Some Hereditarily Irresolvable Spaces ⋮ MONADIC INTUITIONISTIC AND MODAL LOGICS ADMITTING PROVABILITY INTERPRETATIONS ⋮ Reflection algebras and conservation results for theories of iterated truth ⋮ Did Descartes make a diagonal argument? ⋮ Provability algebras and proof-theoretic ordinals. I ⋮ J-Calc: a typed lambda calculus for intuitionistic justification logic ⋮ Unwinding modal paradoxes on digraphs ⋮ A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle ⋮ A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\) ⋮ Effectively constructible fixed points in Sacchetti's modal logics of provability ⋮ Free and projective bimodal symmetric Gödel algebras ⋮ Semantics for dual preferential entailment ⋮ A simple proof of arithmetical completeness for \(\Pi_ 1\)-conservativity logic ⋮ Completeness and definability in the logic of noncontingency ⋮ Liar-type paradoxes and the incompleteness phenomena ⋮ Truth and the Liar ⋮ The structure of lattices of subframe logics ⋮ Designing paradoxes: a revision-theoretic approach ⋮ Modal logic for other-world agnostics: Neutrality and Halldén incompleteness ⋮ Friedman-reflexivity ⋮ An impossibility theorem on beliefs in games ⋮ SOLOVAY-TYPE THEOREMS FOR CIRCULAR DEFINITIONS ⋮ Interconnection of the lattices of extensions of four logics ⋮ De-modalizing the language. The case of physics ⋮ Interpretability suprema in Peano arithmetic ⋮ Intuitionistic logic and modality via topology ⋮ Axiomatization and polynomial solvability of strictly positive fragments of certain modal logics ⋮ Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006 ⋮ The modal logic of Gödel sentences ⋮ Uniform interpolation and propositional quantifiers in modal logics ⋮ On predicate provability logics and binumerations of fragments of Peano arithmetic ⋮ WHAT IS THE CORRECT LOGIC OF NECESSITY, ACTUALITY AND APRIORITY? ⋮ A MACHINE-ASSISTED PROOF OF GÖDEL’S INCOMPLETENESS THEOREMS FOR THE THEORY OF HEREDITARILY FINITE SETS ⋮ The iterative conception of set. A (bi-)modal axiomatisation ⋮ Positive provability logic for uniform reflection principles ⋮ Deducibility and independence in Beklemishev's autonomous provability calculus ⋮ Rosser provability and normal modal logics ⋮ Boolean paradoxes and revision periods ⋮ Lewis meets Brouwer: constructive strict implication ⋮ Unnamed Item ⋮ A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs ⋮ A proof theory for the logic of provability in true arithmetic ⋮ The omega-rule interpretation of transfinite provability logic ⋮ Transductions in arithmetic
This page was built for publication: