2000 character limit reached
On the theories of McDuff's II$_1$ factors
Published 4 Feb 2016 in math.LO and math.OA | (1602.01817v1)
Abstract: Recently, Boutonnet, Chifan, and Ioana proved that McDuff's family of continuum many pairwise nonisomorphic separable II$_1$ factors are in fact pairwise non-elementarily equivalent by proving that any ultrapowers of two distinct members of the family are nonsiomorphic. We use Ehrenfeucht-Fraisse games to provide an upper bound on the quantifier-depth of sentences which distinguish these theories.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.