MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).

## Bourbaki theory of isomorphism, examples of untransportable formulas

In their book "Theory of sets" Bourbaki suggested a general theory of isomorphism.

The example of an untransportable relation (i.e. formula) in the book involves 2 principal base sets.

Are there examples of untrasportable formulas when we allow only one principal base set?

-
Very few people here are familiar with Bourbaki's set theory. You should probably state the definitions here as well. – Harry Gindi Jun 19 2010 at 12:14
A reference is added in the question. – Victor Makarov Jun 22 2010 at 13:44

An example of untrasportable sentence, when there is only one principal base set X, may be the following one:

All elements of the set X are finite sets,

Because, by definition, the truth value of a transportable sentence must be preserved under all bijections from the set X. Obviously, there exists a bijection from X to a set Y, where not all elements of Y are finite sets.

A simpler example is "the set X contains the empty set".

There is a paper "Sentences of type theory: the only sentences preserved under isomorphisms" by Victoria Marshall and Rolando Chuaqui - see The Journal of symbolic Logic, vol 56, #3, Sep 1991.

-