Studia Logica 67 (1):27-59 (2001)
| Authors | |
| Abstract |
We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.
|
| Keywords | Philosophy Logic Mathematical Logic and Foundations Computational Linguistics |
| Categories | (categorize this paper) |
| Reprint years | 2004 |
| DOI | 10.1023/A:1010521410739 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
PhilArchive copy
Upload a copy of this paper Check publisher's policy Papers currently archived: 71,172
External links
- From the Publisher via CrossRef (no proxy)
- dx.doi.org (no proxy)
- link.springer.com (no proxy)
- jstor.org (no proxy)
- logichost.net
(no proxy)
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
- Sign in / register and customize your OpenURL resolver..
- Configure custom resolver
References found in this work BETA
A Borel Reducibility Theory for Classes of Countable Structures.Harvey Friedman & Lee Stanley - 1989 - Journal of Symbolic Logic 54 (3):894-914.
Classifying Positive Equivalence Relations.Claudio Bernardi & Andrea Sorbi - 1983 - Journal of Symbolic Logic 48 (3):529-538.
A Note on Positive Equivalence Relations.A. H. Lachlan - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (1):43-46.
A Note on Positive Equivalence Relations.A. H. Lachlan - 1987 - Mathematical Logic Quarterly 33 (1):43-46.
On Group-Theoretic Decision Problems and Their Classification.Charles F. Miller - 1971 - Princeton University Press.
Citations of this work BETA
Universal Computably Enumerable Equivalence Relations.Uri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro & Andrea Sorbi - 2014 - Journal of Symbolic Logic 79 (1):60-88.
Graphs Realised by R.E. Equivalence Relations.Alexander Gavruskin, Sanjay Jain, Bakhadyr Khoussainov & Frank Stephan - 2014 - Annals of Pure and Applied Logic 165 (7-8):1263-1290.
On Σ1 1 Equivalence Relations Over the Natural Numbers.Ekaterina B. Fokina & Sy-David Friedman - 2012 - Mathematical Logic Quarterly 58 (1-2):113-124.
Linear Orders Realized by C.E. Equivalence Relations.Ekaterina Fokina, Bakhadyr Khoussainov, Pavel Semukhin & Daniel Turetsky - 2016 - Journal of Symbolic Logic 81 (2):463-482.
Jumps of Computably Enumerable Equivalence Relations.Uri Andrews & Andrea Sorbi - 2018 - Annals of Pure and Applied Logic 169 (3):243-259.
View all 15 citations / Add more citations
Similar books and articles
Maximal R.E. Equivalence Relations.Jeffrey S. Carroll - 1990 - Journal of Symbolic Logic 55 (3):1048-1058.
Bounding Minimal Degrees by Computably Enumerable Degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
Ramsey's Theorem for Computably Enumerable Colorings.Tamara J. Hummel & Carl G. Jockusch - 2001 - Journal of Symbolic Logic 66 (2):873-880.
On a Problem of Cooper and Epstein.Shamil Ishmukhametov - 2003 - Journal of Symbolic Logic 68 (1):52-64.
Embedding Finite Lattices Into the Ideals of Computably Enumerable Turing Degrees.William C. Calhoun & Manuel Lerman - 2001 - Journal of Symbolic Logic 66 (4):1791-1802.
Implicit Measurements of Dynamic Complexity Properties and Splittings of Speedable Sets.Michael A. Jahn - 1999 - Journal of Symbolic Logic 64 (3):1037-1064.
Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets.Leo Harrington & Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (2):199-213.
Codable Sets and Orbits of Computably Enumerable Sets.Leo Harrington & Robert I. Soare - 1998 - Journal of Symbolic Logic 63 (1):1-28.
Analytics
Added to PP index
2009-01-28
Total views
75 ( #155,407 of 2,517,824 )
Recent downloads (6 months)
1 ( #409,482 of 2,517,824 )
2009-01-28
Total views
75 ( #155,407 of 2,517,824 )
Recent downloads (6 months)
1 ( #409,482 of 2,517,824 )
How can I increase my downloads?
Downloads
