DOI10.1017/CBO9780511804076zbMath1154.03001OpenAlexW2964933744MaRDI QIDQ3525239
John P. Burgess, George Boolos, Richard C. Jeffrey
Publication date: 12 September 2008
Full work available at URL: https://doi.org/10.1017/cbo9780511804076
Counterfactual logic and the necessity of mathematics ⋮
Rosenkranz's logic of justification and unprovability ⋮
On the ‘definability of definable’ problem of Alfred Tarski, Part II ⋮
Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons) ⋮
Is there a ``Hilbert thesis? ⋮ Closure of a priori knowability under a priori knowable material implication ⋮ Why there is no general solution to the problem of software verification ⋮ Generating candidate busy beaver machines (or how to build the zany zoo) ⋮ On the completeness and the decidability of strictly monadic second‐order logic ⋮ Weak call-by-value lambda calculus as a model of computation in Coq ⋮ The never-ending recursion ⋮ Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино? ⋮ RELEVANCE FOR THE CLASSICAL LOGICIAN ⋮ Completeness of Hoare logic with inputs over the standard model ⋮ Existential Import Today: New Metatheorems; Historical, Philosophical, and Pedagogical Misconceptions ⋮ The enhanced indispensability argument, the circularity problem, and the interpretability strategy ⋮ Computational complexity of theories of a binary predicate with a small number of variables ⋮ Completeness of Hoare Logic Relative to the Standard Model ⋮ A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems ⋮ Modal-epistemic arithmetic and the problem of quantifying in ⋮ Variations on a Montagovian theme ⋮ TRACTARIAN FIRST-ORDER LOGIC: IDENTITY AND THE N-OPERATOR ⋮ The fixed point problem of a simple reversible language ⋮ Proof verification and proof discovery for relativity ⋮ Axiomatic theories of partial ground. I: The base theory ⋮ Axiomatic theories of partial ground. II: Partial ground and hierarchies of typed truth ⋮ Against the judgment-dependence of mathematics and logic ⋮ There is no paradox of logical validity ⋮ Mathematical intuition and natural numbers: a critical discussion ⋮ Action type deontic logic ⋮ The diagonalization method in quantum recursion theory ⋮ Unnamed Item ⋮ Computable axiomatizability of elementary classes ⋮ EXISTENTIAL-IMPORT MATHEMATICS ⋮ REFERENCE IN ARITHMETIC ⋮ On decidability of theories of regular languages ⋮ Gödel's second theorem and the provability of God's existence ⋮ A formalization of multi-tape Turing machines ⋮ Reconstructor: a computer program that uses three-valued logics to represent lack of information in empirical scientific contexts ⋮ Validity, dialetheism and self-reference ⋮ A Tableau System for Quasi-Hybrid Logic ⋮ ON THE DIAGONAL LEMMA OF GÖDEL AND CARNAP ⋮ Truth, disjunction, and induction ⋮ On decidability and axiomatizability of some ordered structures ⋮ Call-by-value lambda calculus as a model of computation in Coq ⋮ Alethic reference ⋮ Realism and empirical equivalence ⋮ WITTGENSTEIN’S ELIMINATION OF IDENTITY FOR QUANTIFIER-FREE LOGIC ⋮ Deciding simple infinity axiom sets with one binary relation by means of superpostulates ⋮ Aspects of Categorical Recursion Theory ⋮ What is the natural abstraction level of an algorithm?
This page was built for publication: Computability and Logic
