Recursive well-orderings
From MaRDI portal
Publication:3227571
DOI10.2307/2266902zbMath0067.00303OpenAlexW1999737391MaRDI QIDQ3227571
Publication date: 1955
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2266902
Related Items
A complete classification of the Δ₂¹-functions, Kleene's Amazing Second Recursion Theorem, Some results in the effective descriptive set theory, Computable linearizations of well-partial-orderings, Decision times of infinite computations, Optimal bounds for ordinal comparison maps, A Π¹₁-uniformization principle for reals, Borel ideals vs. Borel sets of countable relations and trees, On a Π01 Set of Positive Measure, The Mathematical Work of S.C.Kleene, Number theoretic concepts and recursive well-orderings, La prédicativité, The Forcing Method and the Upper Semilattice of Hyperdegrees, Hierarchies of number-theoretic predicates, A recursion theoretic characterization of the Topological Vaught Conjecture in the Zermelo‐Fraenkel set theory, The Π21$\Pi ^1_2$ consequences of a theory, Recursive Pseudo-Well-Orderings, Classes of Polish spaces under effective Borel isomorphism, Inductive definability: Measure and category, A Hierarchy Based on a Type Two Object, On a problem of Kleene’s, On predicates expressible in the $1$-function quantifier forms in Kleene Hierarchy with free variables of type $2$, Cuts of linear orders, Measure-Theoretic Uniformity in Recursion Theory and Set Theory, A Recursion-Theoretic Characterization of the Ramified Analytical Hierarchy, On Minimal and Almost-Minimal Systems of Notations, Hierarchies in Recursive Function Theory, A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES, Hyperarithmetical Sets, The weakness of the pigeonhole principle under hyperarithmetical reductions, Ungroundedness in Tarskian languages, On a class of recursive hierarchies, Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization, Using computability to measure complexity of algebraic structures and classes of structures, On the Equimorphism Types of Linear Orderings, Ranked structures and arithmetic transfinite recursion, The Dyck and the Preiss separation uniformly, AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES, On the First Order Theory of the Arithmetical Degrees, Predicativity and Feferman, Minimal Covers and Hyperdegrees, Arithmetical Predicates and Function Quantifiers, A variation of Richter's construction of ordinals, Kleene’s Amazing Second Recursion Theorem, Recursive nets, On the reducibility of \(\Pi_ 1^ 1\) sets, On bi-embeddable categoricity of algebraic structures, INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS, A Note on Function Quantification, Degree-invariant, analytic equivalence relations without perfectly many classes, Infinite time extensions of Kleene's \({\mathcal O}\), Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem, Recursive Functions Over Well Ordered Partial Orderings, ANALYTIC EQUIVALENCE RELATIONS SATISFYING HYPERARITHMETIC-IS-RECURSIVE, Constructive Versions of Ordinal Number Classes, Classifications of Recursive Functions by Means of Hierarchies, ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS, Metarecursively enumerable sets and admissible ordinals, Über die Bestimmbarkeit des Verhaltens von Algorithmen, Unnamed Item, Degrees of orderings not isomorphic to recursive linear orderings
Cites Work
