论文信息 - Computably Enumerable Equivalence Relations - 字舞流文

Computably Enumerable Equivalence Relations

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

Su Gao | Peter Gerdes

[1] Alexander S. Kechris,et al. The Descriptive Set Theory of Polish Group Actions: DESCRIPTIVE SET THEORY , 1996 .

[2] Y. Moschovakis. Descriptive Set Theory , 1980 .

[3] Andrea Sorbi,et al. Classifying Positive Equivalence Relations , 1983, J. Symb. Log..

[4] A. Kechris,et al. The Descriptive Set Theory of Polish Group Actions: BETTER TOPOLOGIES , 1996 .

[5] André Nies. Recursively Enumerable Equivalence Relations Modulo Finite Differences , 1994, Math. Log. Q..

[6] Charles F. Miller. On Group-Theoretic Decision Problems and Their Classification. , 1971 .

[7] Michael O. Rabin,et al. Recursive Unsolvability of Group Theoretic Problems , 1958 .

[8] Harvey M. Friedman,et al. A Borel reductibility theory for classes of countable structures , 1989, Journal of Symbolic Logic.

[9] Alistair H. Lachlan. A Note on Positive Equivalence Relations , 1987, Math. Log. Q..