Two decidable Markov properties over a class of solvable groups

DOI10.1007/BF01669325MaRDI QIDQ1159764zbMATH OpenFDO

Authors 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

algorithmisomorphism problempolycyclic groupsfinitely presented nilpotent groups

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3139761 (Why is no real title available?)
• scientific article; zbMATH DE number 3672554 (Why is no real title available?)
• scientific article; zbMATH DE number 3451844 (Why is no real title available?)
• scientific article; zbMATH DE number 3110205 (Why is no real title available?)
• A theorem on finitely generated hyperabelian groups
• Computable Algebra, General Theory and Theory of Computable Fields
• Finiteness Conditions for Soluble Groups
• Infinitely generated subgroups of finitely presented groups. I
• The solubility of certain decision problems in arithmetic and algebra

Cited in

(1)

• Model-theoretic and algorithmic questions in group theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1159764)