Polycyclic groups, finite images, and elementary equivalence (Q914824): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the isomorphism problem for polycyclic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finiteness Conditions for Soluble Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Finiteness of Certain Soluble Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Équivalence élémentaire entre groupes finis-par-abéliens de type fini / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary equivalence and isomorphism of finitely generated nilpotent groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shorter Notes: Representations of Polycyclic Groups / rank
 
Normal rank

Revision as of 16:50, 20 June 2024

scientific article
Language Label Description Also known as
English
Polycyclic groups, finite images, and elementary equivalence
scientific article

    Statements

    Polycyclic groups, finite images, and elementary equivalence (English)
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    This paper settles the following question: If G is a polycyclic group and H is a finitely generated group which is elementarily equivalent to G, must H be polycyclic? An affirmative answer follows from the paper's main result, which is purely algebraic in character. It asserts that, if G is polycyclic and H is a finitely generated residually finite group having exactly the same finite images as G, then H is polycyclic. The proof starts with a study of certain abelian groups and reduces the general case to the metabelian case. \(\forall \exists\) sentences provide the link between logic and algebra.
    0 references
    0 references
    0 references
    0 references
    0 references
    elementary equivalence
    0 references
    polycyclic group
    0 references
    finitely generated group
    0 references
    finitely generated residually finite group
    0 references
    finite images
    0 references