DECIDABILITY OF THE UNIVERSAL AND POSITIVE THEORIES OF A FREE GROUP
From MaRDI portal
Publication:3699893
free groups of finite rankuniversal theorypositive theorysolvability of equationspositive formulae on free groups
Model-theoretic algebra (03C60) Free nonabelian groups (20E05) Generators, relations, and presentations of groups (20F05) Basic properties of first-order languages and structures (03C07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Axiomatics and elementary properties of groups (20A05) Metamathematical considerations in group theory (20A10)
Recommendations
- scientific article; zbMATH DE number 3916533
- scientific article; zbMATH DE number 665291
- A reduction of the decidability problem of the theory of a free group
- Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup
- scientific article; zbMATH DE number 4087622
- scientific article; zbMATH DE number 130848
- Decidability of the theories of certain infinite, finitely presented quasigroups
- On ``simple undecidable fragments of the positive theory of a free semigroup
- On the decidability of semigroup freeness.
- scientific article; zbMATH DE number 3974951
Cited in
(53)- Algebraic geometry in varieties of algebras with the given algebra of constants
- Algorithmic undecidability of compatibility problem for equations in free groups: explicit equations with one commutator-type constraint
- Logical aspects of Cayley-graphs: the group case
- The complexity of verbal languages over groups
- On the decidability boundary of the infinite symmetric group
- scientific article; zbMATH DE number 7120897 (Why is no real title available?)
- Elementary theory of free non-abelian groups.
- The isomorphism problem for finitely generated fully residually free groups.
- Irreducible affine varieties over a free group. II: Systems in triangular quasi-quadratic form and description of residually free groups
- Extending free pregroups with lower bounds
- An analysis of Makanin's algorithm deciding solvability of equations in free groups
- Makanin's algorithm is not primitive recursive
- Undecidability of first order sentences in the theory of free groupoids
- Theories of HNN-Extensions and Amalgamated Products
- The finite power property in free groups
- Ideals of equations for elements in a free group and context-free languages
- Algebraic geometry over groups. I: Algebraic sets and ideal theory
- On systems of word equations over three unknowns with at most six occurrences of one of the unknowns
- Seven lectures on universal algebraic geometry
- Finite approximation and commutators in free groups.
- Explicit test sets for iterated morphisms in free monoids and metabelian groups
- On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups
- Universal theories for free solvable groups.
- Existential questions in (relatively) hyperbolic groups.
- Word equations in the context of string solving
- More than 1700 years of word equations
- scientific article; zbMATH DE number 3916533 (Why is no real title available?)
- scientific article; zbMATH DE number 4087622 (Why is no real title available?)
- Generalizations of free groups: some questions
- Universal theory of certain solvable groups and bounded Ore group rings
- scientific article; zbMATH DE number 665292 (Why is no real title available?)
- On some algorithmic problems for groups and monoids
- Finding all solutions of equations in free groups and monoids with involution
- Algebraic and logical aspects of unification
- The non-parametrizability of the word equation \(xyz=zvx\): a short proof
- scientific article; zbMATH DE number 709753 (Why is no real title available?)
- A reduction of the decidability problem of the theory of a free group
- scientific article; zbMATH DE number 665291 (Why is no real title available?)
- ON POSITIVE THEORIES OF GROUPS WITH REGULAR FREE LENGTH FUNCTIONS
- Picture-hanging puzzles
- Decidability of the elementary theory of a finitely defined quasigroup
- Implicit function theorem over free groups.
- Diophantine geometry over groups. II: Completions, closures and formal solutions
- The word matching problem is undecidable for finite special string-rewriting systems that are confluent
- On elementary theories of algebraically closed groups
- The Diophantine problem in the classical matrix groups
- The existential theory of equations with rational constraints in free groups is PSPACE-complete
- Solutions to twisted word equations and equations in virtually free groups
- Diophantine geometry over groups. III: Rigid and solid solutions.
- ∀-free metabelian groups
- Investigations on equations in a free group
- Undecidability of a simple fragment of a positive theory with a single constant for a free semigroup of rank two
- Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup
This page was built for publication: DECIDABILITY OF THE UNIVERSAL AND POSITIVE THEORIES OF A FREE GROUP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3699893)
