Degrees of orderings not isomorphic to recursive linear orderings

DOI10.1016/0168-0072(91)90038-NzbMATH Open0734.03026MaRDI QIDQ810503FDOQ810503

Authors: Carl G. jun. Jockusch, Robert I. Soare 

Publication date: 1991

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Recommendations

• Jumps of Orderings
• Linear orderings of low degree
• Orderings with αth Jump Degree 0 (α)
• Degrees coded in jumps of orderings
• scientific article; zbMATH DE number 1302872

zbMATH Keywords

degrees of unsolvabilitylow degreerecursive linear orderings

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Title not available (Why is that?)
• Recursive Linear Orders with Incomplete Successivities
• Jumps of Orderings
• Degrees coded in jumps of orderings
• Degrees of Structures
• Recursive well-orderings
• Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
• Title not available (Why is that?)
• Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets

Cited In (34)

• 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
• 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
• On the Equimorphism Types of Linear Orderings
• Punctual copies of algebraic structures
• Linear orderings of low degree
• TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
• Computable linear orders and limitwise monotonic functions
• \(d\)-computable categoricity for algebraic fields
• A class of low linear orders having computable presentations
• Title not available (Why is that?)
• Boolean algebras, Stone spaces, and the iterated Turing jump
• \(\Pi_1^1\)-CA\(_0\) and order types of countable ordered groups
• Computability of Fraïssé limits
• Jump degrees of torsion-free abelian groups
• Recursive Linear Orders with Incomplete Successivities
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
• Degree spectra of structures
• On the complexity of the successivity relation in computable linear orderings
• Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
• Scattered linear orderings with no computable presentation
• 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

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)