Publication Date

5-2019

Date of Final Oral Examination (Defense)

3-12-2019

Type of Culminating Activity

Thesis

Degree Title

Master of Science in Mathematics

Department

Mathematics

Major Advisor

Samuel Coskey, Ph.D.

Advisor

John D. Clemens, Ph.D.

Advisor

Marion Scheepers, Ph.D.

Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.

Abstract

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.

DOI

10.18122/td/1536/boisestate

Share

COinS