Suppose a permutation group acts on an underlying atom set and on a collection of objects built over it. A finite subset supports an object when every permutation fixing all members of fixes . Pairing supported objects uses the union of their supports. A definable subset or functional image inherits a support from its domain and parameters. In a hereditarily finite-supported Quine-atom model, every member is recursively required to have such a support; symmetry then rules out a choice function on the pairs of atoms.
Articles by others on the same topic
There are currently no matching articles.