Computable presentability of countable linear orders
From MaRDI portal
Publication:2036473
DOI10.1007/s10958-021-05426-yOpenAlexW3171245407MaRDI QIDQ2036473
Publication date: 29 June 2021
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-021-05426-y
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items
Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders ⋮ Computable linear orders and the ershov hierarchy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computability on linear orderings enriched with predicates
- Linear orderings of low degree
- Cuts of linear orders
- Degrees of orderings not isomorphic to recursive linear orderings
- Every recursive enumerable extension of a theory of linear order has a constructive model
- Efficient linear orders
- On initial segments of computable linear orders
- Computable structures and the hyperarithmetical hierarchy
- Arithmetic hierarchy of Abelian groups
- Computable linear orders and limitwise monotonic functions
- Scattered linear orderings with no computable presentation
- Computable Boolean algebras
- Low linear orderings
- Effective procedures in field theory
- Recursive and Recursively Enumerable Orders
- Notes on the Jump of a Structure
- Increasing η -representable degrees
- A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
- On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
- Sentences true in all constructive models
- Orderings with αth Jump Degree 0 (α)
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Every Low 2 Boolean Algebra has a Recursive Copy
- Δ 2 0 -copies of linear orderings
- CONSTRUCTIVE ALGEBRAS I
- Linear orderings under one-one reducibility
- Constructive order types on cuts
- The strong homogeneity conjecture
