Problem of finite axiomatizability for strongly minimal theories of graphs and groups with a nonzero number of ends (Q2639054)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Problem of finite axiomatizability for strongly minimal theories of graphs and groups with a nonzero number of ends
scientific article

    Statements

    Problem of finite axiomatizability for strongly minimal theories of graphs and groups with a nonzero number of ends (English)
    0 references
    1989
    0 references
    The main result is the following: Let T be a strongly minimal theory of graphs of bounded valence with a nonzero number of ends and T be not categorical in countable power. Then T is not finitely axiomatizable modulo positive propositions. This implies, in particular, that any finitely generated infinite group such that its graph has a nonzero number of ends does not contain a finite set of classes of conjugate elements such that each nontrivial cyclic subgroup has a nontrivial intersection with one of these classes.
    0 references
    graphs and groups with a nonzero number of ends
    0 references
    finite axiomatizability
    0 references
    strongly minimal theory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references