Cuts of linear orders
From MaRDI portal
Publication:651418
DOI10.1007/s11083-010-9194-9zbMath1259.03055OpenAlexW1989804613MaRDI QIDQ651418
Asher M. Kach, Antonio Montalbán
Publication date: 13 December 2011
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-010-9194-9
Related Items
THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES ⋮ On a computable presentation of low linear orderings ⋮ Notes on the Jump of a Structure ⋮ Scattered linear orderings with no computable presentation ⋮ Computable linear orders and limitwise monotonic functions ⋮ Degree spectra of structures ⋮ Computable presentability of countable linear orders
Cites Work
- Unnamed Item
- Computability on linear orderings enriched with predicates
- Computable structures and the hyperarithmetical hierarchy
- Computable Boolean algebras
- The -spectrum of a linear order
- On the $n$-back-and-forth types of Boolean algebras
- Boolean algebra approximations
- Recursive well-orderings
- Notes on the Jump of a Structure
- A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Every Low 2 Boolean Algebra has a Recursive Copy
