Recursive Pseudo-Well-Orderings
From MaRDI portal
Cites work
- Classifications of Recursive Functions by Means of Hierarchies
- scientific article; zbMATH DE number 3176053 (Why is no real title available?)
- scientific article; zbMATH DE number 3250555 (Why is no real title available?)
- Hyperarithmetical quantifiers
- Incompleteness along paths in progressions of theories
- Measure-theoretic construction of incomparable hyperdegrees
- On a problem of Kleene’s
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
- Recursive well-orderings
- The Forcing Method and the Upper Semilattice of Hyperdegrees
Cited in
(45)- Categoricity of computable infinitary theories
- Scott ranks of models of a theory
- Complete groups are complete co-analytic
- Possible-worlds semantics for modal notions conceived as predicates
- Ungroundedness in Tarskian languages
- On the isomorphism problem for some classes of computable algebraic structures
- Reductions between types of numberings
- Degrees of autostability relative to strong constructivizations for Boolean algebras
- The countable admissible ordinal equivalence relation
- Degree-invariant, analytic equivalence relations without perfectly many classes
- Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
- Model Theoretic Complexity of Automatic Structures (Extended Abstract)
- On the Π1 1 -separation principle
- Minimal Covers and Hyperdegrees
- Initial segments of computable linear orders with additional computable predicates
- There is no classification of the decidably presentable structures
- ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR
- Some new computable structures of high rank
- Embedding jump upper semilattices into the Turing degrees
- A recursion theoretic property of \(\mathbf{\Sigma ^1_1}\) equivalence relations
- SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
- An introduction to the Scott complexity of countable structures and a survey of recent results
- THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH
- Incompleteness and jump hierarchies
- Computing sets from all infinite subsets
- FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
- Computability theory, nonstandard analysis, and their connections
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Minimum models of second-order set theories
- The prehistory of the subsystems of second-order arithmetic
- Classes of Polish spaces under effective Borel isomorphism
- Isomorphism relations on computable structures
- A Property of Arithmetic Sets
- THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
- THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES
- Model-theoretic complexity of automatic structures
- Scott sentence complexities of linear orderings
- A classification of incompleteness statements
- Generically computable linear orderings
- Martin's conjecture for regressive functions on the hyperarithmetic degrees
- A one-page proof of a theorem of Beleznay
- Computable structure theory of partial combinatory algebras
- Automatic structures and the problem of natural well-orderings
- Surrealist landscape with figures (a survey of recent results in set theory)
- The isomorphism problem for torsion-free abelian groups is analytic complete
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)
