Increasing η -representable degrees

DOI10.1002/MALQ.200810031zbMath1184.03042OpenAlexW1988106868MaRDI QIDQ3650322

No author found.

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) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)

Related Items (14)

Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders ⋮ A CHARACTERIZATION OF THE STRONGLY -REPRESENTABLE MANY-ONE DEGREES ⋮ On limitwise monotonicity and maximal block functions ⋮ A class of low linear orders having computable presentations ⋮ Automorphisms ofη-like computable linear orderings and Kierstead's conjecture ⋮ THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES ⋮ The Kierstead's conjecture and limitwise monotonic functions ⋮ On a computable presentation of low linear orderings ⋮ Strongly \(\eta \)-representable degrees and limitwise monotonic functions ⋮ Limitwise monotonic functions relative to the Kleene's ordinal notation system ⋮ Computable linear orders and limitwise monotonic functions ⋮ Degree spectra of structures ⋮ Computable presentability of countable linear orders ⋮ On Kierstead’s conjecture

Cites Work

• Unnamed Item
• Limitwise monotonic functions, sets, and degrees on computable domains
• Hierarchies of Boolean algebras

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