Computably Enumerable Equivalence Relations
classification
🧮 math.LO
keywords
ceerscomputablyenumerableequivalencerelationsnotionreducibilityrich
read the original abstract
We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.