Computably Enumerable Equivalence Relations |
| |
Authors: | Gao Su Gerdes Peter |
| |
Institution: | (1) Department of Mathematics, California Institute of Technology, Pasadena, CA, 91125 |
| |
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: | computably enumerable sets |
本文献已被 SpringerLink 等数据库收录! |
|