Recursive Pseudo-Well-Orderings

DOI10.2307/1994961zbMATH Open0186.01101OpenAlexW4236964892MaRDI QIDQ5579489FDOQ5579489

Authors: Joseph Harrison 

Publication date: 1968

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

zbMATH Keywords

recursion theory, constructive mathematics

Cites Work

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

Cited In (38)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5579489)