Nilpotent groups of finite algorithmic dimension

DOI10.1007/BF01054216zbMath0684.20025MaRDI QIDQ1825277

A. V. Molokov, N. S. Romanovskii, Sergei S. Goncharov

Publication date: 1989

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01054216

zbMATH Keywords

nilpotent groups; algorithmic dimension

Mathematics Subject Classification ID

20F18: Nilpotent groups

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

Related Items

Degree Spectra of Relations on Computable Structures, The theory of projective planes is complete with respect to degree spectra and effective dimensions, Computable dimension for ordered fields, Computable torsion-free nilpotent groups of finite dimension., Degree spectra and computable dimensions in algebraic structures, The computable dimension of ordered abelian groups, On positive and constructive groups, On decidable categoricity and almost prime models, Turing degrees of complete formulas of almost prime models, The index set of the groups autostable relative to strong constructivizations, Freely generated projective planes with finite computable dimension, Computable categoricity of trees of finite height

Cites Work

• Recursive isomorphism types of recursive Boolean algebras
• Recursively Categorical Linear Orderings
• Recursively presented Abelian groups: Effective p-Group theory. I
• Unnamed Item
• Unnamed Item