Increasing η -representable degrees

DOI10.1002/MALQ.200810031MaRDI QIDQ3650322zbMATH OpenOpenAlexFDO

Authors

Publication date 14 December 2009

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200810031

zbMATH Keywords

linear orderrepresentationTuring degree

Mathematics Subject Classification ID

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

Cites work

• Hierarchies of Boolean algebras
• scientific article; zbMATH DE number 1303201 (Why is no real title available?)
• Limitwise monotonic functions, sets, and degrees on computable domains

Cited in

(18)

• The Kierstead's conjecture and limitwise monotonic functions
• Computable linear orders and limitwise monotonic functions
• Degree spectra of structures
• Computable presentability of countable linear orders
• Limitwise monotonic functions relative to the Kleene's ordinal notation system
• Increasing \(N\)th degree inequality
• 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
• On limitwise monotonicity and maximal block functions
• A characterization of the strongly -representable many-one degrees
• On Kierstead’s conjecture
• η-representation of sets and degrees
• A class of low linear orders having computable presentations
• THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES
• On a computable presentation of low linear orderings
• Low scattered linear orders
• Strongly -representable degrees and limitwise monotonic functions
• The complexity of the successor and the block relations on computable linear orders

This page was built for publication: Increasing η -representable degrees

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