The coding theorems for linear orders
From MaRDI portal
Cites work
- A class of low linear orders having computable presentations
- A construction for recursive linear orderings
- A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
- A note on \(\Delta_2^0\)-spectra of linear orderings and degree spectra of the successor relation
- Computability on linear orderings enriched with predicates
- Computable Boolean algebras
- Computable structures and the hyperarithmetical hierarchy
- Cuts of linear orders
- Degrees of orderings not isomorphic to recursive linear orderings
- Every Low 2 Boolean Algebra has a Recursive Copy
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Linear orderings of low degree
- Low linear orderings
- Notes on the Jump of a Structure
- On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
- Orderings with αth Jump Degree 0 (α)
- Ranges of \(\eta \)-functions of \(\eta \)-like 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
- The _2⁰-spectrum of a linear order
- THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES
- The strong homogeneity conjecture
- Δ 2 0 -copies of linear orderings
This page was built for publication: The coding theorems for linear orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956376)
