A Survey on Universal Computably Enumerable Equivalence Relations
- 1 December 2016
- book chapter
- Published by Springer Nature
- p. 418-451
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Remarks on Uniformly Finitely Precomplete Positive EquivalencesMathematical Logic Quarterly, 1996
- On weakly pre-complete positive equivalencesSiberian Mathematical Journal, 1991
- A Note on Positive Equivalence RelationsMathematical Logic Quarterly, 1987
- Classifying positive equivalence relationsThe Journal of Symbolic Logic, 1983
- Relatively precomplete numerations and arithmeticJournal of Philosophical Logic, 1982
- On the relation provable equivalence and on partitions in effectively inseparable setsStudia Logica, 1981
- Theorie der Numerierungen IIMathematical Logic Quarterly, 1975
- Theorie der Numerierungen IMathematical Logic Quarterly, 1973
- Creative FunctionsMathematical Logic Quarterly, 1961
- Creative setsMathematical Logic Quarterly, 1955