Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders

DOI10.1134/S0037446617010128zbMath1420.03108MaRDI QIDQ2360265

M. V. Zubkov

Publication date: 30 June 2017

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

computable linear order\(\eta\)-like linear order0'-limitwise monotonic function

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items

A computably enumerable partial ordering without computably enumerable maximal chains and antichains, A class of low linear orders having computable presentations, THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES, The Kierstead's conjecture and limitwise monotonic functions, Computable linear orders and limitwise monotonic functions, Degree spectra of structures, On Kierstead’s conjecture

Cites Work

• Linear orderings of low degree
• Degrees of orderings not isomorphic to recursive linear orderings
• Low linear orderings
• Increasing η -representable degrees
• On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
• Δ 2 0 -copies of linear orderings
• Unnamed Item
• Unnamed Item
• Unnamed Item