scientific article

zbMath0708.03001MaRDI QIDQ3998431

George Boolos, Richard C. Jeffrey

Publication date: 17 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

modal logicforcingprovabilitycomputabilityRamsey's theoremGödel's incompleteness theoremsSkolem-Löwenheim theoremLöb's theoremsecond order logicCraig interpolation lemmaBeth definability theoremnon-standard models of arithmeticundecidability of first-order logicenumerabilityAddison's theoremcompleteness and soundness of first- order logicdecidability of monadic logic with identityhalting problem for Turing machinesPresburger's theoremrepresentation of recursive functions in Robinson's arithmeticTarski's theorem on the undefinability of truthundecidable sentences

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15) Gödel numberings and issues of incompleteness (03F40) Computability and recursion theory (03Dxx)

Related Items (30)

A refutation of Penrose's Gödelian case against artificial intelligence ⋮ Is there a ``Hilbert thesis? ⋮ Is complexity a source of incompleteness? ⋮ Elementary functions and loop programs ⋮ Provability in principle and controversial constructivistic principles ⋮ Expository notes on computability and complexity in (arithmetical) games ⋮ PARACONSISTENT INFERENCE FROM DATA USING EXISTENTIAL Ω-ENTAILMENT ⋮ The dependence of computability on numerical notations ⋮ Bases for structures and theories. I. ⋮ Reflecting in epistemic arithmetic ⋮ The metamathematics of Putnam's model-theoretic arguments ⋮ Super-tasks, accelerating Turing machines and uncomputability ⋮ The modal argument for hypercomputing minds ⋮ 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000 ⋮ The scope of Feferman's semi-intuitionistic set theories and his second conjecture ⋮ The analytical completeness of Dzhaparidze's polymodal logics ⋮ How to deal with unbelievable assertions ⋮ No future ⋮ A new Gödelian argument for hypercomputing minds based on the busy beaver problem ⋮ The descriptive complexity approach to LOGCFL ⋮ A procedural criterion for final derivability in inconsistency-adaptive logics ⋮ Structural recursion as a query language on lists and ordered trees ⋮ Existence and definability of states of the world ⋮ 1999 European Summer Meeting of the Association for Symbolic Logic ⋮ Mathematical instrumentalism meets the conjunction objection ⋮ On interpreting Chaitin's incompleteness theorem ⋮ Direct Dynamic Proofs for the Rescher–Manor Consequence Relations: The Flat Case ⋮ Skolem redux ⋮ TAMING THE INCOMPUTABLE, RECONSTRUCTING THE NONCONSTRUCTIVE AND DECIDING THE UNDECIDABLE IN MATHEMATICAL ECONOMICS ⋮ The logic and meaning of plurals. I

This page was built for publication: