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

DOI10.1134/S0037446617010128MaRDI QIDQ2360265zbMATH OpenFDO

Authors M. V. Zubkov

Publication date 30 June 2017

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

Full work available at URL https://doi.org/10.1134/S0037446617010128

zbMATH Keywords

0'-limitwise monotonic function\(\eta\)-like linear ordercomputable linear order

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Recommendations

• On limitwise monotonicity and maximal block functions
• On maximal block functions of computable \(\eta \)-like linear orderings
• The Kierstead's conjecture and limitwise monotonic functions
• LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
• Limitwise monotonic functions, sets, and degrees on computable domains

Cites work

• Degrees of orderings not isomorphic to recursive linear orderings
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3767656 (Why is no real title available?)
• scientific article; zbMATH DE number 1303201 (Why is no real title available?)
• Increasing η -representable degrees
• LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
• Linear orderings of low degree
• Low linear orderings
• On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
• Δ 2 0 -copies of linear orderings

Cited in

(16)

• A computably enumerable partial ordering without computably enumerable maximal chains and antichains
• The Kierstead's conjecture and limitwise monotonic functions
• Computable linear orders and limitwise monotonic functions
• Degree spectra of structures
• Limitwise monotonic functions relative to the Kleene's ordinal notation system
• On limitwise monotonicity and maximal block functions
• On maximal block functions of computable \(\eta \)-like linear orderings
• Limitwise monotonic functions, sets, and degrees on computable domains
• On Kierstead’s conjecture
• A class of low linear orders having computable presentations
• THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES
• Low scattered linear orders
• The coding theorems for linear orders
• Strongly -representable degrees and limitwise monotonic functions
• The complexity of the successor and the block relations on computable linear orders
• A low scattered linear order of rank 2 without computable copy

This page was built for publication: Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2360265)