scientific article; zbMATH DE number 3635994

zbMATH Open0409.03009MaRDI QIDQ4196401FDOQ4196401

Authors: George Boolos 

Publication date: 1979

Title of this publication is not available (Why is that?)

zbMATH Keywords

MonographDecidabilityPeano ArithmeticModal LogicTextbookGödel Proof PredicateNormal SystemUnprovability of Consistency

Mathematics Subject Classification ID

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)

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

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)