On Kierstead’s conjecture
From MaRDI portal
Publication:5227998
DOI10.1090/tran/7858OpenAlexW2936432642WikidataQ122937862 ScholiaQ122937862MaRDI QIDQ5227998
Publication date: 7 August 2019
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/tran/7858
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Recursive automorphisms of recursive linear orderings
- The Kierstead's conjecture and limitwise monotonic functions
- Limitwise monotonic functions relative to the Kleene's ordinal notation system
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
- Automorphisms ofη-like computable linear orderings and Kierstead's conjecture
- Increasing η -representable degrees
- On Π1-automorphisms of recursive linear orders
- On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
- LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
- Limitwise monotonic functions, sets, and degrees on computable domains
- η-representation of sets and degrees
- Partially Ordered Sets
This page was built for publication: On Kierstead’s conjecture