Increasing η -representable degrees

DOI10.1002/MALQ.200810031zbMATH Open1184.03042OpenAlexW1988106868MaRDI QIDQ3650322FDOQ3650322

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

• Title not available (Why is that?)
• Hierarchies of Boolean algebras
• Limitwise monotonic functions, sets, and degrees on computable domains

Cited In (16)

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

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)