A class of low linear orders having computable presentations
From MaRDI portal
Recommendations
Cites work
- η-representation of sets and degrees
- A theorem on strongly \(\eta \)-representable sets
- Degrees of orderings not isomorphic to recursive linear orderings
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Hierarchies of Boolean algebras
- scientific article; zbMATH DE number 3767656 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1303201 (Why is no real title available?)
- Increasing η -representable degrees
- Initial segments of computable linear orders with additional computable predicates
- LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
- Limitwise monotonic functions, sets, and degrees on computable domains
- Linear orderings of low degree
- Low linear orderings
- On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
- On initial segments of computable linear orders
- Strongly -representable degrees and limitwise monotonic functions
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
- Δ 2 0 -copies of linear orderings
Cited in
(4)
This page was built for publication: A class of low linear orders having computable presentations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072990)
