Computability and Logic
DOI10.1017/CBO9780511804076zbMATH Open1154.03001OpenAlexW2964933744MaRDI QIDQ3525239FDOQ3525239
Authors: George Boolos, John P. Burgess, Richard C. Jeffrey 
Publication date: 12 September 2008
Full work available at URL: https://doi.org/10.1017/cbo9780511804076
Recommendations
consistencyproof theorycompletenessfirst-order logicmodel theorydefinabilityTuring machinecomputability theoryrecursion theoryincompleteness
Modal logic (including the logic of norms) (03B45) Proof theory in general (including proof-theoretic semantics) (03F03) Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Basic properties of first-order languages and structures (03C07) First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Nonstandard models of arithmetic (03H15) Computability and recursion theory (03Dxx)
Cited In (57)
- Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?
- On the ‘definability of definable’ problem of Alfred Tarski, Part II
- Programming infinite machines
- Ramsification and the ramifications of Prior's puzzle
- Call-by-value lambda calculus as a model of computation in Coq
- On decidability and axiomatizability of some ordered structures
- On the completeness and the decidability of strictly monadic second‐order logic
- Mathematical intuition and natural numbers: a critical discussion
- Counterfactual logic and the necessity of mathematics
- Rosenkranz's logic of justification and unprovability
- The fixed point problem of a simple reversible language
- Propositional computability logic I
- Tractarian first-order logic: identity and the N-operator
- The diagonalization method in quantum recursion theory
- Existential import today: new metatheorems; historical, philosophical, and pedagogical misconceptions
- What is the natural abstraction level of an algorithm?
- Against the judgment-dependence of mathematics and logic
- Axiomatic theories of partial ground. I: The base theory
- Axiomatic theories of partial ground. II: Partial ground and hierarchies of typed truth
- Completeness of Hoare logic relative to the standard model
- Title not available (Why is that?)
- Is there a ``Hilbert thesis?
- WITTGENSTEIN’S ELIMINATION OF IDENTITY FOR QUANTIFIER-FREE LOGIC
- Variations on a Montagovian theme
- A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems
- A formalization of multi-tape Turing machines
- Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons)
- Computable axiomatizability of elementary classes
- The enhanced indispensability argument, the circularity problem, and the interpretability strategy
- Action type deontic logic
- RELEVANCE FOR THE CLASSICAL LOGICIAN
- Why there is no general solution to the problem of software verification
- There is no paradox of logical validity
- Closure of a priori knowability under a priori knowable material implication
- Aspects of Categorical Recursion Theory
- Computability, complexity, logic. Transl. from the German
- On decidability of theories of regular languages
- Truth, disjunction, and induction
- Completeness of Hoare logic with inputs over the standard model
- Computational complexity of theories of a binary predicate with a small number of variables
- Gödel's second theorem and the provability of God's existence
- Reconstructor: a computer program that uses three-valued logics to represent lack of information in empirical scientific contexts
- Validity, dialetheism and self-reference
- Generating candidate busy beaver machines (or how to build the zany zoo)
- Alethic reference
- Realism and empirical equivalence
- ON THE DIAGONAL LEMMA OF GÖDEL AND CARNAP
- Existential-import mathematics
- The never-ending recursion
- A tableau system for quasi-hybrid logic
- Title not available (Why is that?)
- Reference in arithmetic
- Title not available (Why is that?)
- Proof verification and proof discovery for relativity
- Weak call-by-value lambda calculus as a model of computation in Coq
- Deciding simple infinity axiom sets with one binary relation by means of superpostulates
- Modal-epistemic arithmetic and the problem of quantifying in
This page was built for publication: Computability and Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525239)
