Nilpotent groups of finite algorithmic dimension
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3747093 (Why is no real title available?)
- scientific article; zbMATH DE number 3787040 (Why is no real title available?)
- Recursive isomorphism types of recursive Boolean algebras
- Recursively Categorical Linear Orderings
- Recursively presented Abelian groups: Effective p-Group theory. I
Cited in
(15)- 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 dimension for ordered fields
- Computable categoricity of trees of finite height
- Computable torsion-free nilpotent groups of finite dimension.
- scientific article; zbMATH DE number 2014436 (Why is no real title available?)
- Degree Spectra of Relations on Computable Structures
- scientific article; zbMATH DE number 4116805 (Why is no real title available?)
- The theory of projective planes is complete with respect to degree spectra and effective dimensions
- Structures of finite punctual dimension \(n>2\)
This page was built for publication: Nilpotent groups of finite algorithmic dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825277)
