Abstract
AbstractWe study the complexity of the classification problem for countable models of set theory (). We prove that the classification of arbitrary countable models of is Borel complete, meaning that it is as complex as it can conceivably be. We then give partial results concerning the classification of countable well‐founded models of .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have