Pages that link to "Item:Q5787743"
From MaRDI portal
The following pages link to On definable sets of positive integers (Q5787743):
Displaying 18 items.
- 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)
- Computing degrees of unsolvability (Q770790) (← links)
- Index sets related to prompt simplicity (Q1115863) (← links)
- In memory of Andrzej Mostowski (Q1237769) (← links)
- Recursion-theoretic ranking and compression (Q1713478) (← links)
- Using computability to measure complexity of algebraic structures and classes of structures (Q2263109) (← links)
- Some characterizations of the first-order functional calculus (Q2626397) (← links)
- Some concepts concerning formal systems of number theory (Q2650392) (← links)
- Zur Theorie der konstruktiven Wohlordnungen (Q2651884) (← links)
- Arithmetical Predicates and Function Quantifiers (Q3226750) (← links)
- Hierarchies of number-theoretic predicates (Q3226751) (← links)
- Some Theorems on Classes of Recursively Enumerable Sets (Q3255349) (← links)
- Hyperarithmetical Sets (Q3305318) (← links)
- Kleene’s Amazing Second Recursion Theorem (Q3644738) (← links)
- A View of Revival of Mathematical Logic in Warsaw, 1945–1975 (Q4611698) (← links)
- All Quantifiers Versus the Quantifier All (Q4611700) (← links)
- Classes of Recursively Enumerable Sets and Their Decision Problems (Q5823276) (← links)
