Describing Groups

DOI10.2178/bsl/1186666149zbMath1167.20017OpenAlexW4245789266MaRDI QIDQ3533517

André Nies

Publication date: 23 October 2008

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c63c4b07cf9bc6a9870f9414e2d32182993ea25c

zbMATH Keywords

first-order logicfinitely generated groupsAbelian groupsfinite automatacountable structuresquasi-finitely axiomatizable groupsaxiomatizable theoriesfinite-automaton presentations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of logic to group theory (20A15) Model-theoretic algebra (03C60) Generators, relations, and presentations of groups (20F05) Automata and formal grammars in connection with logical questions (03D05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Model theory of denumerable and separable structures (03C15)

Related Items

Automatic learners with feedback queries, Interprétation de l'arithmétique dans certains groupes de permutations affines par morceaux d'un intervalle, Finitely Generated Semiautomatic Groups, AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS, 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, Learning pattern languages over groups, Lamplighter groups and automata, R.J. THOMPSON’S GROUPSFANDTARE BI-INTERPRETABLE WITH THE RING OF THE INTEGERS, LOGICISM, INTERPRETABILITY, AND KNOWLEDGE OF ARITHMETIC, Automatic models of first order theories, A computation model with automatic functions and relations as primitive operations, Randomness of formal languages via automatic martingales, Word automatic groups of nilpotency class 2, Semiautomatic structures, Regular bi-interpretability of Chevalley groups over local rings, On the model theory of higher rank arithmetic groups, Finite automata presentable Abelian groups, Isomorphisms of scattered automatic linear orders, A topological zero-one law and elementary equivalence of finitely generated groups, Automatic Presentations for Cancellative Semigroups, A hierarchy of tree-automatic structures, FA-presentable groups and rings, Model-theoretic properties of \(\omega\)-automatic structures, Infinite finitely generated fields are biinterpretable with ℕ, Bi-interpretability of some monoids with the arithmetic and applications, Finitely generated groups are universal among finitely generated structures, The isomorphism relation between tree-automatic structures, The isomorphism problem for tree-automatic ordinals with addition, Complete first-order theories of some classical matrix groups over algebraic integers, Defining Multiplication in Some Additive Expansions of Polynomial Rings, Where Automatic Structures Benefit from Weighted Automata, Learning Pattern Languages over Groups, Automatic presentations for semigroups., The isomorphism problem on classes of automatic structures with transitive relations, UNIFORM DEFINABILITY OF INTEGERS IN REDUCED INDECOMPOSABLE POLYNOMIAL RINGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Équivalence élémentaire entre groupes finis-par-abéliens de type fini
• Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
• Finite presentations of infinite structures: Automata and interpretations
• Aspects of free groups.
• Separating Classes of Groups by First-Order Sentences
• FINITELY GENERATED GROUPS AND FIRST-ORDER LOGIC
• On a correspondence between rings and groups