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

representationlinear orderTuring 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

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

Cited in

(16)

• Degree spectra of structures
• The Kierstead's conjecture and limitwise monotonic functions
• Limitwise monotonic functions relative to the Kleene's ordinal notation system
• Computable linear orders and limitwise monotonic functions
• Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
• η-representation of sets and degrees
• On a computable presentation of low linear orderings
• Increasing \(N\)th degree inequality
• Strongly \(\eta \)-representable degrees and limitwise monotonic functions
• Computable presentability of countable linear orders
• On Kierstead’s conjecture
• Automorphisms of \(\eta\)-like computable linear orderings and Kierstead's conjecture
• A characterization of the strongly \(\eta\)-representable many-one degrees
• On limitwise monotonicity and maximal block functions
• THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES
• A class of low linear orders having computable presentations

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)