paper

Ordinal Definability and Combinatorics of Equivalence Relations

arXiv:1711.04353

Abstract

Assume . Let be a equivalence relation coded in . has an ordinal definable equivalence class without any ordinal definable elements if and only if is unpinned. proves -class section uniformization when is a equivalence relation on which is pinned in every transitive model of containing the real which codes : Suppose is a relation on such that each section is an -class, then there is a function such that for all , . proves that is Jónsson whenever is an ordinal: For every function , there is an with in bijection with and .

Ordinal Definability and Combinatorics of Equivalence Relations · wovepaper