Strongly \(\eta \)-representable degrees and limitwise monotonic functions

DOI10.1007/S10469-011-9146-5zbMath1252.03104OpenAlexW1994886985MaRDI QIDQ695785

M. V. Zubkov

Publication date: 17 December 2012

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-011-9146-5

zbMATH Keywords

\(\eta \)-representable degree\(\mathbf 0'\)-limitwise monotonic function

Mathematics Subject Classification ID

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

Related Items (3)

A class of low linear orders having computable presentations ⋮ THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES ⋮ Computable linear orders and limitwise monotonic functions

Cites Work

• A theorem on strongly \(\eta \)-representable sets
• Increasing η -representable degrees
• Limitwise monotonic functions, sets, and degrees on computable domains
• η-representation of sets and degrees
• Hierarchies of Boolean algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strongly \(\eta \)-representable degrees and limitwise monotonic functions