scientific article

zbMath1014.03001MaRDI QIDQ3148848

John P. Burgess, George Boolos, Richard C. Jeffrey

Publication date: 24 September 2002

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

zbMATH Keywords

consistencycompletenessfirst-order logicmodel theoryproof theorycomputability theorydefinabilityTuring machineincompletenessrecursion theory

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) Proof theory in general (including proof-theoretic semantics) (03F03) Basic properties of first-order languages and structures (03C07) Gödel numberings and issues of incompleteness (03F40) Computability and recursion theory (03Dxx)

Related Items (27)

Adaptive logics using the minimal abnormality strategy are \(\Pi^1_1\)-complex ⋮ Nice embedding in classical logic ⋮ Burgess’PVis Robinson’sQ ⋮ Levels of abstraction and the Turing test ⋮ Book review: Leon Horsten, The Tarskian turn. Deflationism and axiomatic truth. ⋮ Automatic synthesis of logical models for order-sorted first-order theories ⋮ Model approach to grammatical evolution: theory and case study ⋮ Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006 ⋮ Curves in Gödel-space: towards a structuralist ontology of mathematical signs ⋮ The Higman operations and embeddings of recursive groups ⋮ On \(\mathsf{Q}\) ⋮ On undecidability of concatenation theory for one-symbol languages ⋮ The Absence of Multiple Universes of Discourse in the 1936 Tarski Consequence-Definition Paper ⋮ Unnamed Item ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ Plural quantifiers: a modal interpretation ⋮ The power of backtracking and the confinement of length ⋮ CANTORIAN SET THEORY ⋮ Prime simplicity ⋮ Is Universal Computation a Myth? ⋮ Proving semantic properties as first-order satisfiability ⋮ The Interpretation Existence Lemma ⋮ The Epistemology of Computer-Mediated Proofs ⋮ Yes fellows, most human reasoning is complex ⋮ A Note on Computation MTs with Time in Instructions or with Tapes of Fixed Length ⋮ COMPOSITIONALITY, COMPUTABILITY, AND COMPLEXITY ⋮ Reducible Theories and Amalgamations of Models

This page was built for publication: