scientific article

zbMath0298.02003MaRDI QIDQ4052072

George Boolos, Richard C. Jeffrey

Publication date: 1974

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

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) 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) Computability and recursion theory (03Dxx) Proof theory and constructive mathematics (03F99) Nonstandard models (03H99)

Related Items (40)

Representing the knowledge of Turing machines ⋮ On theorems of Gödel and Kreisel: Completeness and Markov's principle ⋮ Kleene's Amazing Second Recursion Theorem ⋮ SUFFICIENT CONDITIONS FOR THE EXISTENCE OF UNDECIDABLE INDIRECTLY REFLECTIVE SENTENCES ⋮ Complexity of the problem of being equivalent to Horn formulas ⋮ Computing the maximum violation of a Bell inequality is an NP-problem ⋮ Elementary realizability ⋮ Inconsistent models of arithmetic. I: Finite models ⋮ Sentence-normalized conditional narrowing modulo in rewriting logic and Maude ⋮ Index sets and presentations of complexity classes ⋮ The unaxiomatizability of a quantified intensional logic ⋮ ABSTRACT FORMS OF QUANTIFICATION IN THE QUANTIFIED ARGUMENT CALCULUS ⋮ Core Gödel ⋮ On first-order theories with provability operator ⋮ Boolos and the Metamathematics of Quine's Definitions of Logical Truth and Consequence ⋮ Omega-consistency and the diamond ⋮ On quasitautologies ⋮ Emergence, reduction and supervenience: a varied landscape ⋮ Computability and Recursion ⋮ Denotation, Paradox and Multiple Meanings ⋮ On a paradox of Hilbert and Bernays ⋮ Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games ⋮ Minimum-complexity pairing functions ⋮ The scope of Gödel's first incompleteness theorem ⋮ Alonzo church:his life, his work and some of his miracles ⋮ Symmetry's end? ⋮ Conservative extensions of models of set theory and generalizations ⋮ On deciding the truth of certain statements involving the notion of consistency ⋮ Incompleteness in a General Setting ⋮ Truthmaker maximalism and the truthmaker paradox ⋮ NuMachine and NuAlgebra ⋮ Two types of deflationism ⋮ Kleene’s Amazing Second Recursion Theorem ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ DEPENDENT CHOICE, PROPERNESS, AND GENERIC ABSOLUTENESS ⋮ The Developments of the Concept of Machine Computability from 1936 to the 1960s ⋮ Proving program inclusion using Hoare's logic ⋮ In Memoriam: George Stephen Boolos 1940–1996 ⋮ Average case optimality for linear problems ⋮ Amending Frege's \textit{Grundgesetze der Arithmetik}

This page was built for publication: