Recursive Pseudo-Well-Orderings

DOI10.2307/1994961zbMath0186.01101OpenAlexW4236964892MaRDI QIDQ5579489

Joseph Harrison

Publication date: 1968

Full work available at URL: https://doi.org/10.2307/1994961

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (38)

Degrees of autostability relative to strong constructivizations for Boolean algebras ⋮ Scott ranks of models of a theory ⋮ AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ On the isomorphism problem for some classes of computable algebraic structures ⋮ There is no classification of the decidably presentable structures ⋮ Complete groups are complete co-analytic ⋮ The countable admissible ordinal equivalence relation ⋮ Model Theoretic Complexity of Automatic Structures (Extended Abstract) ⋮ THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH ⋮ THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES ⋮ Classes of Polish spaces under effective Borel isomorphism ⋮ Initial segments of computable linear orders with additional computable predicates ⋮ Model-theoretic complexity of automatic structures ⋮ Incompleteness and jump hierarchies ⋮ ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR ⋮ Isomorphism relations on computable structures ⋮ On the Π₁ ¹ -separation principle ⋮ Some new computable structures of high rank ⋮ Computing sets from all infinite subsets ⋮ The isomorphism problem for torsion-free abelian groups is analytic complete ⋮ FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS ⋮ Embedding jump upper semilattices into the Turing degrees ⋮ Ungroundedness in Tarskian languages ⋮ A Property of Arithmetic Sets ⋮ A recursion theoretic property of $\mathbf {\Sigma ^1_1}$ equivalence relations ⋮ COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Categoricity of computable infinitary theories ⋮ Possible-worlds semantics for modal notions conceived as predicates ⋮ MINIMUM MODELS OF SECOND-ORDER SET THEORIES ⋮ Surrealist landscape with figures (a survey of recent results in set theory) ⋮ Minimal Covers and Hyperdegrees ⋮ Degree-invariant, analytic equivalence relations without perfectly many classes ⋮ Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem ⋮ Reductions between types of numberings ⋮ THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS ⋮ SCOTT COMPLEXITY OF COUNTABLE STRUCTURES ⋮ THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC

Cites Work

• Recursive well-orderings
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• Measure-theoretic construction of incomparable hyperdegrees
• On a problem of Kleene’s
• Hyperarithmetical quantifiers
• Classifications of Recursive Functions by Means of Hierarchies
• The Forcing Method and the Upper Semilattice of Hyperdegrees
• Incompleteness along paths in progressions of theories
• Unnamed Item
• Unnamed Item

This page was built for publication: Recursive Pseudo-Well-Orderings