Two decidable Markov properties over a class of solvable groups

DOI10.1007/BF01669325zbMath0475.20026MaRDI QIDQ1159764

Frank B. Cannonito

Publication date: 1981

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/187111

zbMATH Keywords

algorithmpolycyclic groupsisomorphism problemfinitely presented nilpotent groups

Mathematics Subject Classification ID

Solvable groups, supersolvable groups (20F16) Nilpotent groups (20F18) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Quasivarieties and varieties of groups (20E10) Word problems, etc. in computability and recursion theory (03D40)

Related Items

Model-theoretic and algorithmic questions in group theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinitely generated subgroups of finitely presented groups. I
• A theorem on finitely generated hyperabelian groups
• The solubility of certain decision problems in arithmetic and algebra
• Computable Algebra, General Theory and Theory of Computable Fields
• Finiteness Conditions for Soluble Groups

This page was built for publication: Two decidable Markov properties over a class of solvable groups