Limitwise monotonic functions, sets, and degrees on computable domains

Journal of Symbolic Logic 75 (1):131-154 (2010)
  Copy   BIBTEX

Abstract

We extend the notion of limitwise monotonic functions to include arbitrary computable domains. We then study which sets and degrees are support increasing limitwise monotonic on various computable domains. As applications, we provide a characterization of the sets S with computable increasing η-representations using support increasing limitwise monotonic sets on ℚ and note relationships between the class of order-computable sets and the class of support increasing limitwise monotonic sets on certain domains.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,990

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Limitwise monotonic sets of reals.Marat Faizrahmanov & Iskander Kalimullin - 2015 - Mathematical Logic Quarterly 61 (3):224-229.
Η-representation of sets and degrees.Kenneth Harris - 2008 - Journal of Symbolic Logic 73 (4):1097-1121.
Order-Computable Sets.Denis Hirschfeldt, Russell Miller & Sergei Podzorov - 2007 - Notre Dame Journal of Formal Logic 48 (3):317-347.
Computable shuffle sums of ordinals.Asher M. Kach - 2008 - Archive for Mathematical Logic 47 (3):211-219.
The Kierstead's Conjecture and limitwise monotonic functions.Guohua Wu & Maxim Zubkov - 2018 - Annals of Pure and Applied Logic 169 (6):467-486.
Bounding Prime Models.Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight & Robert I. Soare - 2004 - Journal of Symbolic Logic 69 (4):1117 - 1142.

Analytics

Added to PP
2010-09-12

Downloads
55 (#374,079)

6 months
6 (#791,556)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

The Kierstead's Conjecture and limitwise monotonic functions.Guohua Wu & Maxim Zubkov - 2018 - Annals of Pure and Applied Logic 169 (6):467-486.
Torsion-free abelian groups with optimal Scott families.Alexander G. Melnikov - 2018 - Journal of Mathematical Logic 18 (1):1850002.

Add more citations

References found in this work

Computable Models of Theories with Few Models.Bakhadyr Khoussainov, Andre Nies & Richard A. Shore - 1997 - Notre Dame Journal of Formal Logic 38 (2):165-178.
Computability theory and linear orders.Rod Downey - 1998 - In I︠U︡riĭ Leonidovich Ershov (ed.), Handbook of recursive mathematics. New York: Elsevier. pp. 138--823.
Η-representation of sets and degrees.Kenneth Harris - 2008 - Journal of Symbolic Logic 73 (4):1097-1121.
Computable shuffle sums of ordinals.Asher M. Kach - 2008 - Archive for Mathematical Logic 47 (3):211-219.
Order-Computable Sets.Denis Hirschfeldt, Russell Miller & Sergei Podzorov - 2007 - Notre Dame Journal of Formal Logic 48 (3):317-347.

Add more references