On limitwise monotonicity and maximal block functions
From MaRDI portal
Publication:3195647
DOI10.3233/COM-150037zbMath1337.03064MaRDI QIDQ3195647
Publication date: 20 October 2015
Published in: Computability (Search for Journal in Brave)
03D45: Theory of numerations, effectively presented structures
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The block relation in computable linear orders
- Computable shuffle sums of ordinals
- On initial segments of computable linear orders
- Computable models of theories with few models
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- Order-computable sets
- Effective categoricity of equivalence structures
- Prime models of theories of computable linear orderings
- Low linear orderings
- Computable categoricity of trees of finite height
- Increasing η -representable degrees
- On computable self-embeddings of computable linear orderings
- On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
- Recursively Categorical Linear Orderings
- η-representation of sets and degrees