Degrees of orderings not isomorphic to recursive linear orderings
From MaRDI portal
Publication:810503
DOI10.1016/0168-0072(91)90038-NzbMath0734.03026MaRDI QIDQ810503
Carl G. jun. Jockusch, Robert I. Soare
Publication date: 1991
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)
Related Items
Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders ⋮ 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09 ⋮ Linear orderings of low degree ⋮ Punctual copies of algebraic structures ⋮ A class of low linear orders having computable presentations ⋮ Boolean algebras, Stone spaces, and the iterated Turing jump ⋮ THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES ⋮ On the jumps of the degrees below a recursively enumerable degree ⋮ Some Questions in Computable Mathematics ⋮ A note on \(\Delta_2^0\)-spectra of linear orderings and degree spectra of the successor relation ⋮ Degree spectra of real closed fields ⋮ Jump degrees of torsion-free abelian groups ⋮ On a computable presentation of low linear orderings ⋮ – CA0 and order types of countable ordered groups ⋮ A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS ⋮ Up to equimorphism, hyperarithmetic is recursive ⋮ Recursive Linear Orders with Incomplete Successivities ⋮ The -spectrum of a linear order ⋮ TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS ⋮ Every recursive Boolean algebra is isomorphic to one with incomplete atoms ⋮ Scattered linear orderings with no computable presentation ⋮ On the Equimorphism Types of Linear Orderings ⋮ Every Low Boolean Algebra is Isomorphic to a Recursive One ⋮ Jumps of Orderings ⋮ Computable linear orders and limitwise monotonic functions ⋮ Degree spectra of structures ⋮ Computable presentability of countable linear orders ⋮ Computability of Fraïssé limits ⋮ ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS ⋮ d-computable categoricity for algebraic fields ⋮ On computable self-embeddings of computable linear orderings ⋮ COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
Cites Work
- Unnamed Item
- Unnamed Item
- Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
- Recursive well-orderings
- Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
- Jumps of Orderings
- Degrees coded in jumps of orderings
- Recursive Linear Orders with Incomplete Successivities
- Degrees of Structures
This page was built for publication: Degrees of orderings not isomorphic to recursive linear orderings
