Limitwise monotonic functions, sets, and degrees on computable domains

DOI10.2178/jsl/1264433912zbMath1184.03043OpenAlexW2157963460MaRDI QIDQ5190192

Asher M. Kach, Daniel D. Turetsky

Publication date: 15 March 2010

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

Full work available at URL: https://doi.org/10.2178/jsl/1264433912

zbMATH Keywords

limitwise monotonic function\(\eta \)-representationcomputable domainsorder-computable sets

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items (12)

A CHARACTERIZATION OF THE STRONGLY -REPRESENTABLE MANY-ONE DEGREES ⋮ Torsion-free abelian groups with optimal Scott families ⋮ A class of low linear orders having computable presentations ⋮ Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism ⋮ THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES ⋮ The Kierstead's conjecture and limitwise monotonic functions ⋮ Strongly \(\eta \)-representable degrees and limitwise monotonic functions ⋮ Computable linear orders and limitwise monotonic functions ⋮ A theorem on strongly \(\eta \)-representable sets ⋮ On Kierstead’s conjecture ⋮ Increasing η -representable degrees ⋮ Limitwise monotonic sequences and degree spectra of structures

Cites Work

• Unnamed Item
• Computable shuffle sums of ordinals
• On initial segments of computable linear orders
• Computable models of theories with few models
• Order-computable sets

This page was built for publication: Limitwise monotonic functions, sets, and degrees on computable domains