Recursive well-orderings

DOI10.2307/2266902MaRDI QIDQ3227571zbMATH OpenOpenAlexFDO

Authors Clifford Spector

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

zbMATH Keywords

philosophy and foundations of mathematics

Cites work

• On the Forms of the Predicates in the Theory of Constructive Ordinals
• Recursively enumerable sets of positive integers and their decision problems
• The upper semi-lattice of degrees of recursive unsolvability
• Zur Theorie der konstruktiven Wohlordnungen

Cited in

(67)

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

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)