The following pages link to Computability and Logic (Q3525239):
Displaying 50 items.
- Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons) (Q306278) (← links)
- Closure of a priori knowability under a priori knowable material implication (Q320484) (← links)
- A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems (Q441879) (← links)
- Proof verification and proof discovery for relativity (Q514557) (← links)
- Mathematical intuition and natural numbers: a critical discussion (Q535375) (← links)
- A formalization of multi-tape Turing machines (Q744986) (← links)
- Alethic reference (Q777945) (← links)
- Realism and empirical equivalence (Q777948) (← links)
- Counterfactual logic and the necessity of mathematics (Q830377) (← links)
- Rosenkranz's logic of justification and unprovability (Q830400) (← links)
- Completeness of Hoare logic with inputs over the standard model (Q896915) (← links)
- The diagonalization method in quantum recursion theory (Q972447) (← links)
- Weak call-by-value lambda calculus as a model of computation in Coq (Q1687735) (← links)
- The never-ending recursion (Q1688713) (← links)
- Axiomatic theories of partial ground. I: The base theory (Q1749802) (← links)
- Axiomatic theories of partial ground. II: Partial ground and hierarchies of typed truth (Q1749803) (← links)
- Against the judgment-dependence of mathematics and logic (Q1758555) (← links)
- The fixed point problem of a simple reversible language (Q1989327) (← links)
- On decidability of theories of regular languages (Q2043872) (← links)
- Validity, dialetheism and self-reference (Q2054126) (← links)
- Deciding simple infinity axiom sets with one binary relation by means of superpostulates (Q2096446) (← links)
- What is the natural abstraction level of an algorithm? (Q2117593) (← links)
- Why there is no general solution to the problem of software verification (Q2151520) (← links)
- There is no paradox of logical validity (Q2254573) (← links)
- Action type deontic logic (Q2258815) (← links)
- Gödel's second theorem and the provability of God's existence (Q2297968) (← links)
- Truth, disjunction, and induction (Q2312097) (← links)
- On decidability and axiomatizability of some ordered structures (Q2318170) (← links)
- Call-by-value lambda calculus as a model of computation in Coq (Q2319993) (← links)
- Modal-epistemic arithmetic and the problem of quantifying in (Q2442888) (← links)
- Variations on a Montagovian theme (Q2443347) (← links)
- Is there a ``Hilbert thesis''? (Q2631647) (← links)
- Generating candidate busy beaver machines (or how to build the zany zoo) (Q2672601) (← links)
- The enhanced indispensability argument, the circularity problem, and the interpretability strategy (Q2695151) (← links)
- Computational complexity of theories of a binary predicate with a small number of variables (Q2696689) (← links)
- Computable axiomatizability of elementary classes (Q2793906) (← links)
- EXISTENTIAL-IMPORT MATHEMATICS (Q2795301) (← links)
- A Tableau System for Quasi-Hybrid Logic (Q2817942) (← links)
- Existential Import Today: New Metatheorems; Historical, Philosophical, and Pedagogical Misconceptions (Q2963970) (← links)
- Completeness of Hoare Logic Relative to the Standard Model (Q2971129) (← links)
- ON THE DIAGONAL LEMMA OF GÖDEL AND CARNAP (Q3386609) (← links)
- TRACTARIAN FIRST-ORDER LOGIC: IDENTITY AND THE N-OPERATOR (Q4899960) (← links)
- REFERENCE IN ARITHMETIC (Q4961744) (← links)
- WITTGENSTEIN’S ELIMINATION OF IDENTITY FOR QUANTIFIER-FREE LOGIC (Q5001549) (← links)
- Aspects of Categorical Recursion Theory (Q5014598) (← links)
- On the ‘definability of definable’ problem of Alfred Tarski, Part II (Q5045614) (← links)
- (Q5091265) (← links)
- RELEVANCE FOR THE CLASSICAL LOGICIAN (Q5107541) (← links)
- Reconstructor: a computer program that uses three-valued logics to represent lack of information in empirical scientific contexts (Q5217250) (← links)
- On the completeness and the decidability of strictly monadic second‐order logic (Q6047662) (← links)
