scientific article; zbMATH DE number 1748024
From MaRDI portal
Publication:4530220
zbMATH Open1002.03037MaRDI QIDQ4530220FDOQ4530220
Publication date: 30 May 2002
Title of this publication is not available (Why is that?)
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Undecidability and degrees of sets of sentences (03D35)
Cited In (9)
- UNDECIDABILITY AND THE DEVELOPABILITY OF PERMUTOIDS AND RIGID PSEUDOGROUPS
- Undecidability of the freedom problem for 3-manifold groups.
- An analysis of Makanin's algorithm deciding solvability of equations in free groups
- Undecidability of first order sentences in the theory of free groupoids
- Unitriangular groups and undecidability
- Equations in words and lengths with endomorphisms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Recommendations
- On equations with subgroup restrictions on solutions in free groups 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Algorithmic undecidability of compatibility problem for equations in free groups: explicit equations with one commutator-type constraint 👍 👎
- On equations in free groups with restrictions on solutions. 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530220)
