Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Σ^1_1-complete Equivalence Relations on the Generalized Baire Space

Published 18 Sep 2012 in math.LO | (1209.3932v1)

Abstract: Working with uncountable structures of fixed cardinality, we investigate the complexity of certain equivalence relations and show that if V = L, then many of them are \Sigma1_1-complete, in particular the isomorphism relation of dense linear orders. Then we show that it is undecidable in ZFC whether or not the isomorphism relation of a certain well behaved theory (stable, NDOP, NOTOP) is \Sigma1_1-complete (it is, if V = L, but can be forced not to be).

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.