Characterizing Borel Isomorphism Among Some Weakly Minimal Trivial Theories

2024/09/20 by Danielle Ulrich, Ulrich, Danielle
Mathematics · Computer Science · #Advanced Topology and Set Theory #Mathematical and Theoretical Analysis #Computability, Logic, AI Algorithms

paper · pdf · doi:10.48550/arxiv.2409.13134

Abstract

We characterize having Borel isomorphism relation among some weakly minimal trivial theories, namely the examples of families of finite equivalence relations from recent joint work with Laskowski, and tame expansions of crosscutting-equivalence relations. We also prove a dichotomy in Borel complexity for the latter.

Related

• The Borel Complexity of Isomorphism for O-Minimal Theories
• A Borel-reducibility Counterpart of Shelah's Main Gap Theorem
• Borel complexity of families of finite equivalence relations via large cardinals
• Isomorphism of pointed minimal systems is not classifiable by countable structures
• The Borel Complexity of Isomorphism for Complete Theories of Linear Orders With Unary Predicates