Strongly -representable degrees and limitwise monotonic functions

DOI10.1007/S10469-011-9146-5zbMATH Open1252.03104OpenAlexW1994886985MaRDI QIDQ695785FDOQ695785

Authors: 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

Recommendations

• η-representation of sets and degrees
• Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
• A characterization of the strongly \(\eta\)-representable many-one degrees
• Limitwise monotonic sequences and degree spectra of structures
• Limitwise monotonic functions, sets, and degrees on computable domains

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hierarchies of Boolean algebras
• The Ershov hierarchy
• Title not available (Why is that?)
• Increasing η -representable degrees
• Limitwise monotonic functions, sets, and degrees on computable domains
• η-representation of sets and degrees
• A theorem on strongly \(\eta \)-representable sets

Cited In (5)

• Limitwise monotonic functions, sets, and degrees on computable domains
• A characterization of the strongly \(\eta\)-representable many-one degrees
• Computable linear orders and limitwise monotonic functions
• A class of low linear orders having computable presentations
• THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q695785)