Computably Enumerable Equivalence Relations

Details Computably Enumerable Equivalence Relations Computably Enumerable Equivalence Relations

2010-12-04

arxiv.org/abs/1012.0944v1

"Computably enumerable equivalence relations," Studia Logica, vol. 67, pp. 27- 59, February 2001

Mathematics

Logic

Scientific paper

10.1023/A:1010521410739

We study computably enumerable equivalence relations (ceers) on N and unravel
a rich structural theory for a strong notion of reducibility among ceers.

Affiliated with

Also associated with

No associations

Rating

Computably Enumerable Equivalence Relations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computably Enumerable Equivalence Relations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computably Enumerable Equivalence Relations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-517215