Limitwise monotonic functions, sets, and degrees on computable domains

Journal of Symbolic Logic 75 (1):131-154 (2010)
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
Keywords Limitwise monotonic function   η-representation
Categories (categorize this paper)
DOI 10.2178/jsl/1264433912
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,209
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Asher M. Kach (2008). Computable Shuffle Sums of Ordinals. Archive for Mathematical Logic 47 (3):211-219.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Michael Stob (1983). Wtt-Degrees and T-Degrees of R.E. Sets. Journal of Symbolic Logic 48 (4):921-930.

Monthly downloads

Added to index


Total downloads

19 ( #243,637 of 1,940,985 )

Recent downloads (6 months)

4 ( #225,856 of 1,940,985 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.