η-representation of sets and degrees

DOI10.2178/JSL/1230396908zbMath1158.03025OpenAlexW2163874927MaRDI QIDQ5502806

Kenneth D. Harris

Publication date: 9 January 2009

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.110.1541

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)

Related Items (15)

A CHARACTERIZATION OF THE STRONGLY -REPRESENTABLE MANY-ONE DEGREES ⋮ 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09 ⋮ On limitwise monotonicity and maximal block functions ⋮ Iterated effective embeddings of abelian p-groups ⋮ A class of low linear orders having computable presentations ⋮ Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism ⋮ A Friedberg enumeration of equivalence structures ⋮ Automorphisms ofη-like computable linear orderings and Kierstead's conjecture ⋮ Effectively infinite classes of numberings and computable families of reals ⋮ Strongly \(\eta \)-representable degrees and limitwise monotonic functions ⋮ COMPUTABLE ABELIAN GROUPS ⋮ Computable linear orders and limitwise monotonic functions ⋮ A theorem on strongly \(\eta \)-representable sets ⋮ On Kierstead’s conjecture ⋮ Limitwise monotonic sequences and degree spectra of structures

Cites Work

• Computable models of theories with few models
• Order-computable sets

This page was built for publication: η-representation of sets and degrees