Recursive Linear Orders with Incomplete Successivities
From MaRDI portal
Recommendations
Cites work
- A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
- Degrees of orderings not isomorphic to recursive linear orderings
- Finite condensations of recursive linear orders
- Hierarchies of Boolean algebras
- scientific article; zbMATH DE number 3869317 (Why is no real title available?)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3767656 (Why is no real title available?)
- On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
- Recursive Boolean algebras with recursive atoms
- Recursive isomorphism types of recursive Boolean algebras
- Reducibility and Completeness for Sets of Integers
- Some properties of the constructivization of Boolean algebras
- T-Degrees, Jump Classes, and Strong Reducibilities
- The strong homogeneity conjecture
Cited in
(19)- Degree spectra of the successor relation of computable linear orderings
- Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007
- Recursive linear orders with recursive successivities
- Every recursive Boolean algebra is isomorphic to one with incomplete atoms
- Initial segments of recursive linear orders
- A linear operator approach to succession rules
- Computable linear orders and limitwise monotonic functions
- A theory of recursive dimension of ordered sets
- A note on \(\Delta_2^0\)-spectra of linear orderings and degree spectra of the successor relation
- On the triple jump of the set of atoms of a Boolean algebra
- Partial Orders, Event Structures and Linear Strategies
- Relations Intrinsically Recursive in Linear Orders
- Decidable discrete linear orders
- Degrees of orders on torsion-free abelian groups
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- scientific article; zbMATH DE number 749928 (Why is no real title available?)
- Presentations of the successor relation of computable linear ordering
- The complexity of the successor and the block relations on computable linear orders
- Degrees of orderings not isomorphic to recursive linear orderings
This page was built for publication: Recursive Linear Orders with Incomplete Successivities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3977226)
