Plus ultra

Journal of Mathematical Logic 15 (2):1550008 (2015)
  Copy   BIBTEX

Abstract

We define a reasonably well-behaved class of ultraimaginaries, i.e. classes modulo [Formula: see text]-invariant equivalence relations, called tame, and establish some basic simplicity-theoretic facts. We also show feeble elimination of supersimple ultraimaginaries: If [Formula: see text] is an ultraimaginary definable over a tuple [Formula: see text] with [Formula: see text], then [Formula: see text] is eliminable up to rank [Formula: see text]. Finally, we prove some uniform versions of the weak canonical base property.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,127

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Galois-stability for Tame abstract elementary classes.Rami Grossberg & Monica Vandieren - 2006 - Journal of Mathematical Logic 6 (01):25-48.
Ordinal definability and combinatorics of equivalence relations.William Chan - 2019 - Journal of Mathematical Logic 19 (2):1950009.
New jump operators on equivalence relations.John D. Clemens & Samuel Coskey - 2022 - Journal of Mathematical Logic 22 (3).

Analytics

Added to PP
2015-12-01

Downloads
25 (#654,840)

6 months
9 (#355,374)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Ample thoughts.Daniel Palacín & Frank O. Wagner - 2013 - Journal of Symbolic Logic 78 (2):489-510.
Constructing an almost hyperdefinable group.Itay Ben-Yaacov, Ivan Tomašić & Frank O. Wagner - 2004 - Journal of Mathematical Logic 4 (02):181-212.
Some remarks on one-basedness.Frank O. Wagner - 2004 - Journal of Symbolic Logic 69 (1):34-38.
Simplicity Theory.Byunghan Kim - 2013 - Oxford University Press.

View all 8 references / Add more references