On a computable presentation of low linear orderings
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 1303201 (Why is no real title available?)
- Boolean algebra approximations
- Computability on linear orderings enriched with predicates
- Computable Boolean algebras
- Computable shuffle sums of ordinals
- 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
- Increasing η -representable degrees
- 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
- Scattered linear orderings with no computable presentation
- Δ 2 0 -copies of linear orderings
Cited in
(10)- Low linear orderings
- scientific article; zbMATH DE number 1873432 (Why is no real title available?)
- Linear Order Types of Nonrecursive Presentability
- Scattered linear orderings with no computable presentation
- Computability on linear orderings enriched with predicates
- Negative dense linear orders
- Linear orderings of low degree
- A characterization of the strongly \(\eta\)-representable many-one degrees
- Relative complexity for computable presentations of the conventional linear order on the set of naturals
- A class of low linear orders having computable presentations
This page was built for publication: On a computable presentation of low linear orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q669557)
