Nilpotent groups of finite algorithmic dimension

DOI10.1007/BF01054216zbMath0684.20025OpenAlexW2044599705MaRDI 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 groupsalgorithmic dimension

Mathematics Subject Classification ID

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

Related Items (12)

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

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

This page was built for publication: Nilpotent groups of finite algorithmic dimension