Separating Classes of Groups by First-Order Sentences
classes of groupsfinitely generated groupsfinitely presented groupsfirst-order logicprime modelsquasi finitely axiomatizable groupsword problem
Model-theoretic algebra (03C60) Recursively (computably) enumerable sets and degrees (03D25) Axiomatics and elementary properties of groups (20A05) Applications of logic to group theory (20A15) Quasivarieties and varieties of groups (20E10) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
For classes of groups \(\mathcal C\) and \(\mathcal D\), we say that \(\mathcal D\) is separated from \(\mathcal C\) if there is a first-order sentence that holds in some group in \(\mathcal D\) but fails in all groups in \(\mathcal C\). For various \(\mathcal C\) and \(\mathcal D\), it is shown that \(\mathcal D\) is separated from \(\mathcal C\): (1)~\(\mathcal D=\) finitely presented groups with solvable word problem, \(\mathcal C=\) finite groups; (2)~\(\mathcal D=\) finitely presented groups, \(\mathcal C=\) countable groups that have a presentation with solvable word problem, (3)~\(\mathcal D=\) finitely generated groups with solvable word problem, \(\mathcal C=\) finitely presented groups; (4)~\(\mathcal D=\) finitely generated groups, \(\mathcal C=\) recursively presented groups; (5)~\(\mathcal D=\) countable groups, \(\mathcal C=\) finitely generated groups. To prove the result for~(3), the author shows that for any prime \(p\) the wreath product \(\mathbb{Z}_p\text{\,wr\,}\mathbb{Z}\) is QFA. Here a finitely generated group \(G\) is called quasi finitely axiomatizable (QFA, for short) if there exists a first-order sentence which holds in \(G\) and determines \(G\) up to isomorphism in the class of finitely generated groups. (Since \(\mathbb{Z}_p\text{\,wr\,}\mathbb{Z}\) is finitely generated with solvable word problem but not finitely presented then the result follows.) It is also shown that the group \(\text{UT}_3(\mathbb{Z})\) is QFA and is a prime model of its theory. A byproduct is that the true arithmetic is interpretable in any class of finitely generated groups that contains \(\text{UT}_3(\mathbb{Z})\). Reviewer's remark: Recently F. Oger found new examples of QFA groups and proved that for a finitely generated finite-by-nilpotent group \(G\) the following are equivalent: (i) \(G\) is QFA; (ii) \(G\) is a prime model of its theory; (iii) every element of \(Z(G)\) is of finite order modulo \(G'\). This generalizes the result about \(\text{UT}_3(\mathbb{Z})\) and answers some questions posed in the paper under review. Some further examples of QFA groups were recently found by the author.
- Separating systems of conjunctions.
- Admissible sets in group theory
- Elementary equivalence of rings with finitely generated additive groups
- Aspects of free groups.
- Finitely generated groups are universal among finitely generated structures
- First-order rigidity of rings satisfying polynomial identities
- On the direct products of quasi-finitely axiomatizable groups.
- First order rigidity of non-uniform higher rank arithmetic groups
- Bi-interpretability and QFA structures: study of some soluble groups and commutative rings. (Bi-interprétabilité et structures QFA : étude de groupes résolubles et des anneaux commutatifs
- R.J. THOMPSON’S GROUPSFANDTARE BI-INTERPRETABLE WITH THE RING OF THE INTEGERS
- 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10
- Interprétation de l'arithmétique dans certains groupes de permutations affines par morceaux d'un intervalle
- 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05
- Describing Groups
- scientific article; zbMATH DE number 3928977 (Why is no real title available?)
- scientific article; zbMATH DE number 3948587 (Why is no real title available?)
- scientific article; zbMATH DE number 88867 (Why is no real title available?)
- Polycyclic-by-finite groups and first-order sentences
- 4 Rich groups, weak second-order logic, and applications
- Finite axiomatizability for profinite groups
- Comparing quasi-finitely axiomatizable and prime groups
- FINITELY GENERATED GROUPS AND FIRST-ORDER LOGIC
- Quasi-finitely axiomatizable nilpotent groups
- Quasi-finitely axiomatizable groups and groups which are prime models
- Regular bi-interpretability of Chevalley groups over local rings
- Defining \(R\) and \(G(R)\)
- Bounded generation and commutator width of Chevalley groups: function case
- On the model theory of higher rank arithmetic groups
- Defining algorithmically presented structures in first order logic
This page was built for publication: Separating Classes of Groups by First-Order Sentences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3043615)