Recursive Pseudo-Well-Orderings
From MaRDI portal
Publication:5579489
Cites work
- scientific article; zbMATH DE number 3176053 (Why is no real title available?)
- scientific article; zbMATH DE number 3250555 (Why is no real title available?)
- Classifications of Recursive Functions by Means of Hierarchies
- 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
(38)- Minimal Covers and Hyperdegrees
- Categoricity of computable infinitary theories
- Computing sets from all infinite subsets
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Computability theory, nonstandard analysis, and their connections
- A recursion theoretic property of \(\mathbf{\Sigma ^1_1}\) equivalence relations
- Model-theoretic complexity of automatic structures
- Minimum models of second-order set theories
- 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
- Some new computable structures of high rank
- Isomorphism relations on computable structures
- FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
- Scott ranks of models of a theory
- THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH
- Initial segments of computable linear orders with additional computable predicates
- Possible-worlds semantics for modal notions conceived as predicates
- Reductions between types of numberings
- On the isomorphism problem for some classes of computable algebraic structures
- THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
- A Property of Arithmetic Sets
- Complete groups are complete co-analytic
- Surrealist landscape with figures (a survey of recent results in set theory)
- THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES
- The isomorphism problem for torsion-free abelian groups is analytic complete
- Incompleteness and jump hierarchies
- Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
- There is no classification of the decidably presentable structures
- The countable admissible ordinal equivalence relation
- Embedding jump upper semilattices into the Turing degrees
- Degree-invariant, analytic equivalence relations without perfectly many classes
- The prehistory of the subsystems of second-order arithmetic
- On the Π1 1 -separation principle
- An introduction to the Scott complexity of countable structures and a survey of recent results
- SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
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)
