Date of Final Oral Examination (Defense)
Type of Culminating Activity
Master of Science in Mathematics
Samuel Coskey, Ph.D.
John D. Clemens, Ph.D.
Marion Scheepers, Ph.D.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Computable reducibility of equivalence relations is a tool to compare the complexity of equivalence relations on natural numbers. Its use is important to those doing Borel equivalence relation theory, computability theory, and computable structure theory. In this thesis, we compare many naturally occurring equivalence relations with respect to computable reducibility. We will then define a jump operator on equivalence relations and study proprieties of this operation and its iteration. We will then apply this new jump operation by studying its effect on the isomorphism relations of well-founded computable trees.
Krakoff, Marcello Gianni, "Computable Reducibility of Equivalence Relations" (2019). Boise State University Theses and Dissertations. 1536.