Recursive well-orderings
From MaRDI portal
Cites work
Cited in
(67)- A recursion theoretic characterization of the topological Vaught conjecture in the Zermelo-Fraenkel set theory
- Minimal Covers and Hyperdegrees
- Martin's conjecture for regressive functions on the hyperarithmetic degrees
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Metarecursively enumerable sets and admissible ordinals
- Analytic equivalence relations satisfying hyperarithmetic-is-recursive
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
- Inductive definability: Measure and category
- The Π21\Pi ^1_2 consequences of a theory
- Recursive Functions Over Well Ordered Partial Orderings
- On Minimal and Almost-Minimal Systems of Notations
- Number theoretic concepts and recursive well-orderings
- A complete classification of the Δ₂¹-functions
- Ungroundedness in Tarskian languages
- On predicates expressible in the $1$-function quantifier forms in Kleene Hierarchy with free variables of type $2$
- Arithmetical Predicates and Function Quantifiers
- Hierarchies of number-theoretic predicates
- The Mathematical Work of S.C.Kleene
- Classes of Polish spaces under effective Borel isomorphism
- Hyperarithmetical Sets
- Kleene's amazing second recursion theorem
- A Note on Function Quantification
- The Dyck and the Preiss separation uniformly
- A hierarchy of computably enumerable degrees
- Using computability to measure complexity of algebraic structures and classes of structures
- Kleene’s Amazing Second Recursion Theorem
- Recursive Pseudo-Well-Orderings
- Constructive Versions of Ordinal Number Classes
- scientific article; zbMATH DE number 3139751 (Why is no real title available?)
- The Forcing Method and the Upper Semilattice of Hyperdegrees
- Some results in the effective descriptive set theory
- On the First Order Theory of the Arithmetical Degrees
- On categoricity of scattered linear orders of constructive ranks
- On the Equimorphism Types of Linear Orderings
- Hierarchies in Recursive Function Theory
- Predicativity and Feferman
- La prédicativité
- On a problem of Kleene’s
- The weakness of the pigeonhole principle under hyperarithmetical reductions
- Decision times of infinite computations
- Degrees of orderings not isomorphic to recursive linear orderings
- On bi-embeddable categoricity of algebraic structures
- Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
- Infinite time extensions of Kleene's \({\mathcal O}\)
- Borel ideals vs. Borel sets of countable relations and trees
- Iterated priority arguments in descriptive set theory
- A Π¹₁-uniformization principle for reals
- Measure-Theoretic Uniformity in Recursion Theory and Set Theory
- Optimal bounds for ordinal comparison maps
- Algorithmic complexity for theories of commutative Kleene algebras
- Ordinal analysis of partial combinatory algebras
- Degree-invariant, analytic equivalence relations without perfectly many classes
- A Recursion-Theoretic Characterization of the Ramified Analytical Hierarchy
- Cuts of linear orders
- Algorithmic complexity of theories with Kleene iteration
- Über die Bestimmbarkeit des Verhaltens von Algorithmen
- Countable ordered groups and Weihrauch reducibility
- Computable linearizations of well-partial-orderings
- Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization
- A variation of Richter's construction of ordinals
- Recursive nets
- On the reducibility of \(\Pi_ 1^ 1\) sets
- A Hierarchy Based on a Type Two Object
- On a class of recursive hierarchies
- On a Π01 Set of Positive Measure
- Classifications of Recursive Functions by Means of Hierarchies
- Ranked structures and arithmetic transfinite recursion
This page was built for publication: Recursive well-orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3227571)
