Pages that link to "Item:Q3226751"
From MaRDI portal
The following pages link to Hierarchies of number-theoretic predicates (Q3226751):
Displayed 50 items.
- Effective topological spaces. II: A hierarchy (Q1073020) (← links)
- Effective topological spaces. III: Forcing and definability (Q1098842) (← links)
- Index sets in computable analysis (Q1292400) (← links)
- Index sets for \(\Pi^0_1\) classes (Q1295386) (← links)
- Extending partial orders to dense linear orders (Q1295404) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- A new concept of predicative truth and definability (Q2264656) (← links)
- Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies (Q2453581) (← links)
- Kleene's Amazing Second Recursion Theorem (Q3161629) (← links)
- Arithmetical Predicates and Function Quantifiers (Q3226750) (← links)
- The classical and the <i>ω</i>-complete arithmetic (Q3252699) (← links)
- A Note on Function Quantification (Q3252702) (← links)
- (Q3256314) (← links)
- Measure-theoretic construction of incomparable hyperdegrees (Q3256319) (← links)
- Logical reflection and formalism (Q3257117) (← links)
- The Class of Recursive Functions (Q3259703) (← links)
- Constructive definition of certain analytic sets of numbers (Q3265667) (← links)
- Recursive Functions Over Well Ordered Partial Orderings (Q3272473) (← links)
- On a problem of Kleene’s (Q3276698) (← links)
- On predicates expressible in the $1$-function quantifier forms in Kleene Hierarchy with free variables of type $2$ (Q3276700) (← links)
- Constructive Versions of Ordinal Number Classes (Q3281066) (← links)
- Classifications of Recursive Functions by Means of Hierarchies (Q3291527) (← links)
- Hyperarithmetical Sets (Q3305318) (← links)
- AN APPLICATION OF RECURSION THEORY TO ANALYSIS (Q3386607) (← links)
- On the Equimorphism Types of Linear Orderings (Q3594486) (← links)
- Kleene’s Amazing Second Recursion Theorem (Q3644738) (← links)
- Functional interpretation and inductive definitions (Q3655246) (← links)
- Forcing and reductibilities. II. Forcing in fragments of analysis (Q3691651) (← links)
- The theory of recursive functions, approaching its centennial (Q3946156) (← links)
- Nonlinear phenomena in spaces of algorithms (Q4467341) (← links)
- LUZIN’S (N) AND RANDOMNESS REFLECTION (Q5082065) (← links)
- THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC (Q5274882) (← links)
- La prédicativité (Q5339291) (← links)
- Systems of predicative analysis (Q5344166) (← links)
- Extensions of the constructive ordinals (Q5344168) (← links)
- Classes of Polish spaces under effective Borel isomorphism (Q5365177) (← links)
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS (Q5485751) (← links)
- On the notational independence of various hierarchies of degrees of unsolvability (Q5509684) (← links)
- An introduction to hyperarithmetical functions (Q5532534) (← links)
- La théorie des fonctions récursives et ses applications. (Exposé d'information générale) (Q5536266) (← links)
- A complete classification of the Δ₂¹-functions (Q5551156) (← links)
- Some results in the effective descriptive set theory (Q5567856) (← links)
- Degrees of unsolvability of constructible sets of integers (Q5582332) (← links)
- A Hierarchy Based on a Type Two Object (Q5585408) (← links)
- Hierarchies of Effective Descriptive Set Theory (Q5585409) (← links)
- Measure-Theoretic Uniformity in Recursion Theory and Set Theory (Q5609369) (← links)
- Definability in the monadic second-order theory of successor (Q5609381) (← links)
- On Minimal and Almost-Minimal Systems of Notations (Q5622174) (← links)
- Abstract Computability and Invariant Definability (Q5622176) (← links)
- Hierarchies over recursive well-orderings (Q5623679) (← links)