Computable presentability of countable linear orders
From MaRDI portal
Recommendations
Cites work
- A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
- Arithmetic hierarchy of Abelian groups
- Computability and computable models
- Computability on linear orderings enriched with predicates
- Computable Boolean algebras
- Computable linear orders and limitwise monotonic functions
- Computable structures and the hyperarithmetical hierarchy
- CONSTRUCTIVE ALGEBRAS I
- Constructive order types on cuts
- Cuts of linear orders
- Degrees of orderings not isomorphic to recursive linear orderings
- Effective procedures in field theory
- Efficient linear orders
- Every Low 2 Boolean Algebra has a Recursive Copy
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Every recursive enumerable extension of a theory of linear order has a constructive model
- scientific article; zbMATH DE number 3128730 (Why is no real title available?)
- scientific article; zbMATH DE number 3715794 (Why is no real title available?)
- 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 1048041 (Why is no real title available?)
- scientific article; zbMATH DE number 1531924 (Why is no real title available?)
- scientific article; zbMATH DE number 1450824 (Why is no real title available?)
- scientific article; zbMATH DE number 3250559 (Why is no real title available?)
- scientific article; zbMATH DE number 3074066 (Why is no real title available?)
- Increasing η -representable degrees
- Linear orderings of low degree
- Linear orderings under one-one reducibility
- Low linear orderings
- Notes on the Jump of a Structure
- On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
- On initial segments of computable linear orders
- Orderings with αth Jump Degree 0 (α)
- Recursive and Recursively Enumerable Orders
- Scattered linear orderings with no computable presentation
- Sentences true in all constructive models
- The strong homogeneity conjecture
- Δ 2 0 -copies of linear orderings
Cited in
(8)- Presentations of computably enumerable reals.
- Computable linear orders and the ershov hierarchy
- Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders
- scientific article; zbMATH DE number 1303201 (Why is no real title available?)
- COMPUTABLE LINEAR ORDERS AND PRODUCTS
- A class of low linear orders having computable presentations
- A low scattered linear order of rank 2 without computable copy
- A coding of the countable linear orderings
This page was built for publication: Computable presentability of countable linear orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2036473)
