On a computable presentation of low linear orderings
From MaRDI portal
Publication:669557
DOI10.1134/S1995080218090020zbMATH Open1423.03148OpenAlexW2909191269MaRDI QIDQ669557FDOQ669557
Authors: Juan-Miguel Gracia 
Publication date: 15 March 2019
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1995080218090020
Recommendations
Cites Work
- Title not available (Why is that?)
- Scattered linear orderings with no computable presentation
- Computability on linear orderings enriched with predicates
- Every Low 2 Boolean Algebra has a Recursive Copy
- Linear orderings of low degree
- Computable Boolean algebras
- Title not available (Why is that?)
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Δ 2 0 -copies of linear orderings
- On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
- Degrees of orderings not isomorphic to recursive linear orderings
- Boolean algebra approximations
- Notes on the Jump of a Structure
- Cuts of linear orders
- Low linear orderings
- Increasing η -representable degrees
- Computable shuffle sums of ordinals
Cited In (10)
- Title not available (Why is that?)
- 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
- Negative dense linear orders
- Linear Order Types of Nonrecursive Presentability
- Computability on linear orderings enriched with predicates
- Low linear orderings
- Linear orderings of low degree
- A class of low linear orders having computable presentations
- Scattered linear orderings with no computable presentation
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)
