The study of computable structures and equivalence relations lies at the intersection of computability theory, algebra and logic, and provides essential insights into the classification and decision ...
In this paper precomplete equivalence relations are introduced in dominical and recursion categories. After recalling definitions in $\S2$, in $\S3$ an analogue of Ersov's Fixed Point Theorem is ...
Proceedings of the American Mathematical Society, Vol. 126, No. 11 (Nov., 1998), pp. 3361-3370 (10 pages) We introduce a notion of quasinormality for a nested pair ${\cal S}\subset {\cal R}$ of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback