Describing Groups
From MaRDI portal
Abelian groupsaxiomatizable theoriescountable structuresfinite automatafinite-automaton presentationsfinitely generated groupsfirst-order logicquasi-finitely axiomatizable groups
Model theory of denumerable and separable structures (03C15) Model-theoretic algebra (03C60) Automata and formal grammars in connection with logical questions (03D05) Applications of logic to group theory (20A15) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Formal languages and automata (68Q45)
Recommendations
Cites work
- Aspects of free groups.
- Finite presentations of infinite structures: Automata and interpretations
- FINITELY GENERATED GROUPS AND FIRST-ORDER LOGIC
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- scientific article; zbMATH DE number 51556 (Why is no real title available?)
- scientific article; zbMATH DE number 3211026 (Why is no real title available?)
- scientific article; zbMATH DE number 3307642 (Why is no real title available?)
- On a correspondence between rings and groups
- Separating Classes of Groups by First-Order Sentences
- Équivalence élémentaire entre groupes finis-par-abéliens de type fini
Cited in
(39)- Automatic presentations for semigroups.
- Learning pattern languages over groups
- Semiautomatic structures
- Bi-interpretability of some monoids with the arithmetic and applications
- Finitely generated groups are universal among finitely generated structures
- Complete first-order theories of some classical matrix groups over algebraic integers
- Lamplighter groups and automata
- A topological zero-one law and elementary equivalence of finitely generated groups
- Model-theoretic properties of \(\omega\)-automatic structures
- The isomorphism problem for tree-automatic ordinals with addition
- Randomness of formal languages via automatic martingales
- Isomorphisms of scattered automatic linear orders
- Automatic learners with feedback queries
- 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
- A computation model with automatic functions and relations as primitive operations
- Defining multiplication in some additive expansions of polynomial rings
- Learning pattern languages over groups
- The isomorphism problem on classes of automatic structures with transitive relations
- R.J. THOMPSON’S GROUPSFANDTARE BI-INTERPRETABLE WITH THE RING OF THE INTEGERS
- Logicism, interpretability, and knowledge of arithmetic
- Where automatic structures benefit from weighted automata
- Breaking up finite automata presentable torsion-free Abelian groups.
- Interprétation de l'arithmétique dans certains groupes de permutations affines par morceaux d'un intervalle
- Finitely generated semiautomatic groups
- Automatic Presentations for Cancellative Semigroups
- Infinite finitely generated fields are biinterpretable with ℕ
- Automatic models of first order theories
- An introduction to the Scott complexity of countable structures and a survey of recent results
- A hierarchy of tree-automatic structures
- Finite Automata Presentable Abelian Groups
- Uniform definability of integers in reduced indecomposable polynomial rings
- Word automatic groups of nilpotency class 2
- Regular bi-interpretability of Chevalley groups over local rings
- On the model theory of higher rank arithmetic groups
- Finite automata presentable Abelian groups
- Groups elementarily equivalent to metabelian Baumslag-Solitar groups and regular bi-interpretability
- The isomorphism relation between tree-automatic structures
- On the first-order genus of wreath products and their central extensions
- FA-presentable groups and rings
This page was built for publication: Describing Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3533517)
