On isomorphism classes of computably enumerable equivalence relations

Journal of Symbolic Logic:1-26 (forthcoming)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1017/jsl.2019.39
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 43,780
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

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Classes Bounded by Incomplete Sets.Kejia Ho & Frank Stephan - 2002 - Annals of Pure and Applied Logic 116 (1-3):273-295.
An Interval of Computably Enumerable Isolating Degrees.Matthew C. Salts - 1999 - Mathematical Logic Quarterly 45 (1):59-72.
Isomorphism Testing For Equivalence Relations.Edward Szczypka - 1996 - Reports on Mathematical Logic:101-109.
Jumps of Computably Enumerable Equivalence Relations.Uri Andrews & Andrea Sorbi - 2018 - Annals of Pure and Applied Logic 169 (3):243-259.
Difference Sets and Computability Theory.Rod Downey, Zoltán Füredi, Carl G. Jockusch & Lee A. Rubel - 1998 - Annals of Pure and Applied Logic 93 (1-3):63-72.
The Computably Enumerable Degrees Are Locally Non-Cappable.Matthew B. Giorgi - 2003 - Archive for Mathematical Logic 43 (1):121-139.

Analytics

Added to PP index
2019-06-14

Total views
3 ( #1,178,792 of 2,265,041 )

Recent downloads (6 months)
3 ( #449,910 of 2,265,041 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature