We describe a collection of finite multiplication patterns. For finite sets
write
Call -forbidden if the following theory, in expanded by unary symbols , is inconsistent:
  • , together with the assertion that every is an automorphism;
  • for every ;
  • for every .
Let contain the group axioms and, for every -forbidden finite pattern, the sentence
This is a first-order theory in the language of groups.
Suppose is -good. Choose and an embedding . If a tuple in realized a forbidden pattern, interpreting as would give a model of its supposedly inconsistent automorphism theory. Thus no such tuple exists, and .
Conversely, suppose is -bad. By part (e), there is a finite set for which is inconsistent. Let
The associated automorphism theory is precisely , up to renaming its function symbols, so is -forbidden. But realizes in , and therefore violates the corresponding forbidding axiom. Hence .
We have proved

Articles by others on the same topic (0)

There are currently no matching articles.