LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS

DOI10.1142/9789814360548_0004zbMath1279.03063MaRDI QIDQ4922660

Asher M. Kach, Daniel D. Turetsky, Rodney G. Downey

Publication date: 3 June 2013

Published in: Proceedings of the 11th Asian Logic Conference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789814360548_0004

zbMATH Keywords

survey paper; computably enumerable degree; d.c.e. sets; c.e. sets; degree spectra; limitwise monotonic functions; computable linear orderings

Mathematics Subject Classification ID

03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations

03D20: Recursive functions and relations, subrecursive hierarchies

03D25: Recursively (computably) enumerable sets and degrees

03C57: Computable structure theory, computable model theory

Related Items

A Friedberg enumeration of equivalence structures, A CHARACTERIZATION OF THE STRONGLY -REPRESENTABLE MANY-ONE DEGREES, On Kierstead’s conjecture, A class of low linear orders having computable presentations, Rogers semilattices of limitwise monotonic numberings, THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES, Limitwise monotonic reducibility on sets and on pairs of sets, The Kierstead's conjecture and limitwise monotonic functions, Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism, Computable linear orders and limitwise monotonic functions, Limitwise monotonic spectra and their generalizations, Limitwise monotonic reducibility of sets and \(\Sigma\)-definability of abelian groups, Degrees of bi-embeddable categoricity of equivalence structures, On \(\Delta_2^0\)-categoricity of equivalence relations, Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders, Effectively categorical abelian groups, Limitwise monotonic sequences and degree spectra of structures, Computable completely decomposable groups