The Kierstead's conjecture and limitwise monotonic functions

DOI10.1016/J.APAL.2018.01.003zbMath1459.03066OpenAlexW2783463375WikidataQ122924579 ScholiaQ122924579MaRDI QIDQ1709678

Guohua Wu, M. V. Zubkov

Publication date: 6 April 2018

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2018.01.003

zbMATH Keywords

automorphismlimitwise monotonic functionrecursive linear order

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (2)

Computable linear orders and limitwise monotonic functions ⋮ On Kierstead’s conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Recursive automorphisms of recursive linear orderings
• 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 Π₁-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

This page was built for publication: The Kierstead's conjecture and limitwise monotonic functions