Computably enumerable equivalence relations

Studia Logica 67 (1):27-59 (2001)
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
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,300
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
And Equivalence Structures.Douglas Cenzer, Valentina Harizanov & Jeffrey B. Remmel - 2011 - Annals of Pure and Applied Logic 162 (7):490-503.

View all 6 citations / Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
24 ( #216,192 of 2,193,213 )

Recent downloads (6 months)
1 ( #290,278 of 2,193,213 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature