Degrees of orderings not isomorphic to recursive linear orderings
From MaRDI portal
(Redirected from Publication:810503)
Recommendations
Cites work
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3732037 (Why is no real title available?)
- Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
- Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
- Degrees coded in jumps of orderings
- Degrees of Structures
- Jumps of Orderings
- Recursive Linear Orders with Incomplete Successivities
- Recursive well-orderings
Cited in
(35)- The \(\Delta_2^0\)-spectrum of a linear order
- On computable self-embeddings of computable linear orderings
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Some Questions in Computable Mathematics
- Every recursive Boolean algebra is isomorphic to one with incomplete atoms
- Computable presentability of countable linear orders
- A computable functor from graphs to fields
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
- Degree spectra of real closed fields
- Δ 2 0 -copies of linear orderings
- On the jumps of the degrees below a recursively enumerable degree
- Linear orderings of low degree
- On the Equimorphism Types of Linear Orderings
- Punctual copies of algebraic structures
- Computable linear orders and limitwise monotonic functions
- TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
- \(d\)-computable categoricity for algebraic fields
- scientific article; zbMATH DE number 176213 (Why is no real title available?)
- A class of low linear orders having computable presentations
- \(\Pi_1^1\)-CA\(_0\) and order types of countable ordered groups
- Boolean algebras, Stone spaces, and the iterated Turing jump
- Computability of Fraïssé limits
- Jump degrees of torsion-free abelian groups
- Recursive Linear Orders with Incomplete Successivities
- Degree spectra of structures
- On the complexity of the successivity relation in computable linear orderings
- Scattered linear orderings with no computable presentation
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
- Up to equimorphism, hyperarithmetic is recursive
- On a computable presentation of low linear orderings
- THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES
- Jumps of Orderings
- 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09
- A note on \(\Delta_2^0\)-spectra of linear orderings and degree spectra of the successor relation
- Every linear order isomorphic to its cube is isomorphic to its square
This page was built for publication: Degrees of orderings not isomorphic to recursive linear orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810503)
