Describing Groups
finitely generated groupsfinite automatafirst-order logicAbelian groupscountable structuresquasi-finitely axiomatizable groupsaxiomatizable theoriesfinite-automaton presentations
Formal languages and automata (68Q45) Model-theoretic algebra (03C60) Automata and formal grammars in connection with logical questions (03D05) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Model theory of denumerable and separable structures (03C15) Applications of logic to group theory (20A15)
- 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?)
- Aspects of free groups.
- FINITELY GENERATED GROUPS AND FIRST-ORDER LOGIC
- Finite presentations of infinite structures: Automata and interpretations
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- 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
- Finite Automata Presentable Abelian Groups
- Regular bi-interpretability of Chevalley groups over local rings
- Lamplighter groups and automata
- A hierarchy of tree-automatic structures
- Finite automata presentable Abelian groups
- Bi-interpretability of some monoids with the arithmetic and applications
- Infinite finitely generated fields are biinterpretable with ℕ
- The isomorphism relation between tree-automatic structures
- Automatic Presentations for Cancellative Semigroups
- Logicism, interpretability, and knowledge of arithmetic
- Learning pattern languages over groups
- Where automatic structures benefit from weighted automata
- Defining multiplication in some additive expansions of polynomial rings
- 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
- Breaking up finite automata presentable torsion-free Abelian groups.
- Complete first-order theories of some classical matrix groups over algebraic integers
- Finitely generated semiautomatic groups
- Model-theoretic properties of \(\omega\)-automatic structures
- Uniform definability of integers in reduced indecomposable polynomial rings
- A topological zero-one law and elementary equivalence of finitely generated groups
- Word automatic groups of nilpotency class 2
- Isomorphisms of scattered automatic linear orders
- The isomorphism problem for tree-automatic ordinals with addition
- Learning pattern languages over groups
- Groups elementarily equivalent to metabelian Baumslag-Solitar groups and regular bi-interpretability
- FA-presentable groups and rings
- The isomorphism problem on classes of automatic structures with transitive relations
- Automatic presentations for semigroups.
- A computation model with automatic functions and relations as primitive operations
- Finitely generated groups are universal among finitely generated structures
- R.J. THOMPSON’S GROUPSFANDTARE BI-INTERPRETABLE WITH THE RING OF THE INTEGERS
- Semiautomatic structures
- Interprétation de l'arithmétique dans certains groupes de permutations affines par morceaux d'un intervalle
- On the model theory of higher rank arithmetic groups
- An introduction to the Scott complexity of countable structures and a survey of recent results
- Randomness of formal languages via automatic martingales
- Automatic models of first order theories
- Automatic learners with feedback queries
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)
