Pages that link to "Item:Q5843994"
From MaRDI portal
The following pages link to Recursive Predicates and Quantifiers (Q5843994):
Displaying 50 items.
- Computation as an unbounded process (Q418791) (← links)
- Tarski's theory of definability: Common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic (Q598270) (← links)
- The incompleteness theorems after 70 years (Q598275) (← links)
- Levels of undecidability in rewriting (Q627134) (← links)
- Intermediate logics and the de Jongh property (Q627438) (← links)
- On simplicity of formulas (Q757354) (← links)
- Computing degrees of unsolvability (Q770790) (← links)
- An enumeration of the primitive recursive functions without repetition (Q775448) (← links)
- Exotic quantifiers, complexity classes, and complete problems (Q1022429) (← links)
- Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
- Effective topological spaces. I: A definability theory (Q1061121) (← links)
- The minimum degree of recursively representable choice functions (Q1072546) (← links)
- Effective topological spaces. II: A hierarchy (Q1073020) (← links)
- Effective topological spaces. III: Forcing and definability (Q1098842) (← links)
- Simplicity, immunity, relativizations and nondeterminism (Q1115610) (← links)
- Index sets related to prompt simplicity (Q1115863) (← links)
- Characterizing parallel hierarchies by reducibilities (Q1183416) (← links)
- A second step toward the polynomial hierarchy (Q1253656) (← links)
- Index sets and presentations of complexity classes (Q1366536) (← links)
- Toward a theory of intelligence (Q1434366) (← links)
- The never-ending recursion (Q1688713) (← links)
- Recursion-theoretic ranking and compression (Q1713478) (← links)
- On the hardness of analyzing probabilistic programs (Q1733103) (← links)
- Definability, decidability, complexity (Q1817073) (← links)
- Gödel's reception of Turing's model of computability: the ''shift of perception'' in 1934 (Q2011634) (← links)
- Péter on Church's thesis, constructivity and computers (Q2117808) (← links)
- Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy (Q2148810) (← links)
- Parametric Church's thesis: synthetic computability without choice (Q2151397) (← links)
- Using computability to measure complexity of algebraic structures and classes of structures (Q2263109) (← links)
- Computable permutations and word problems (Q2314871) (← links)
- Levy and set theory (Q2493914) (← links)
- The many forms of hypercomputation (Q2497883) (← links)
- Automata theory and control theory - a rapprochement (Q2522559) (← links)
- The use of lists in the study of undecidable problems in automata theory (Q2551463) (← links)
- On the realizations of predicate formulas (Q2557239) (← links)
- Bemerkung über die Primpolynomzerlegung in endlich vielen Schritten (Q2650742) (← links)
- Zur Theorie der konstruktiven Wohlordnungen (Q2651884) (← links)
- Can Church's thesis be viewed as a Carnapian explication? (Q2695029) (← links)
- Formalism and intuition in computability (Q2941588) (← links)
- On the Hardness of Almost–Sure Termination (Q2946345) (← links)
- On the degree spectrum of a $\Pi ^0_1$ class (Q3053473) (← links)
- The metamathematics of Stable Ramsey’s Theorem for Pairs (Q3190948) (← links)
- Arithmetical Predicates and Function Quantifiers (Q3226750) (← links)
- Hierarchies of number-theoretic predicates (Q3226751) (← links)
- Recursive and Recursively Enumerable Orders (Q3244106) (← links)
- On predicates expressible in the $1$-function quantifier forms in Kleene Hierarchy with free variables of type $2$ (Q3276700) (← links)
- My Life as a Logician (Q3305314) (← links)
- Hyperarithmetical Sets (Q3305318) (← links)
- Leon Henkin the Reviewer (Q3454809) (← links)
- Kleene’s Amazing Second Recursion Theorem (Q3644738) (← links)
