Publications > Preprint server > Preprint Number 2672
Preprint Number 2672
2672. Michael C. Laskowski and Danielle S. Ulrich Borel complexity of families of finite equivalence relations via large cardinals E-mail: Submission date: 15 July 2024 Abstract: We consider a large family of theories of equivalence relations, each with finitely many classes, and assuming the existence of an ω-Erdos cardinal, we determine which of these theories are Borel complete. We develop machinery, including forbidding nested sequences which implies a tight upper bound on Borel complexity, and admitting cross-cutting absolutely indiscernible sets which in our context implies Borel completeness. In the Appendix we classify the reducts of theories of refining equivalence relations, possibly with infinite splitting. Mathematics Subject Classification: 03C15, 03E15 Keywords and phrases: |
Last updated: July 25 2024 15:16 | Please send your corrections to: |