The following pages link to Recursive well-orderings (Q3227571):
Displaying 46 items.
- Cuts of linear orders (Q651418) (← links)
- The Dyck and the Preiss separation uniformly (Q720760) (← links)
- Degrees of orderings not isomorphic to recursive linear orderings (Q810503) (← links)
- Infinite time extensions of Kleene's \({\mathcal O}\) (Q1031833) (← links)
- Borel ideals vs. Borel sets of countable relations and trees (Q1120573) (← links)
- Inductive definability: Measure and category (Q1155049) (← links)
- On a class of recursive hierarchies (Q1211045) (← links)
- Ungroundedness in Tarskian languages (Q2000676) (← links)
- On bi-embeddable categoricity of algebraic structures (Q2067511) (← links)
- Decision times of infinite computations (Q2153830) (← links)
- Using computability to measure complexity of algebraic structures and classes of structures (Q2263109) (← links)
- Computable linearizations of well-partial-orderings (Q2385530) (← links)
- A variation of Richter's construction of ordinals (Q2544410) (← links)
- Recursive nets (Q2546045) (← links)
- On the reducibility of \(\Pi_ 1^ 1\) sets (Q2547889) (← links)
- Degree-invariant, analytic equivalence relations without perfectly many classes (Q2832838) (← links)
- Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem (Q2841359) (← links)
- Kleene's Amazing Second Recursion Theorem (Q3161629) (← links)
- On the First Order Theory of the Arithmetical Degrees (Q3216640) (← links)
- Arithmetical Predicates and Function Quantifiers (Q3226750) (← links)
- Hierarchies of number-theoretic predicates (Q3226751) (← links)
- A Note on Function Quantification (Q3252702) (← links)
- (Q3256314) (← 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)
- On the Equimorphism Types of Linear Orderings (Q3594486) (← links)
- Kleene’s Amazing Second Recursion Theorem (Q3644738) (← links)
- Optimal bounds for ordinal comparison maps (Q3737421) (← links)
- Minimal Covers and Hyperdegrees (Q4075452) (← links)
- A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES (Q4637942) (← links)
- The Mathematical Work of S.C.Kleene (Q4837673) (← links)
- ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS (Q5015728) (← links)
- A recursion theoretic characterization of the Topological Vaught Conjecture in the Zermelo‐Fraenkel set theory (Q5108130) (← links)
- The weakness of the pigeonhole principle under hyperarithmetical reductions (Q5163163) (← links)
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES (Q5207571) (← links)
- Predicativity and Feferman (Q5214793) (← links)
- ANALYTIC EQUIVALENCE RELATIONS SATISFYING HYPERARITHMETIC-IS-RECURSIVE (Q5250130) (← links)
- La prédicativité (Q5339291) (← links)
- Classes of Polish spaces under effective Borel isomorphism (Q5365177) (← links)
- Some results in the effective descriptive set theory (Q5567856) (← links)
- The Π21$\Pi ^1_2$ consequences of a theory (Q6176438) (← links)
- Algorithmic complexity for theories of commutative Kleene algebras (Q6492397) (← links)
