Citations of:

The complexity of central series in nilpotent computable groups

Annals of Pure and Applied Logic 162 (8):667-678 (2011)

You must login to add citations.

Computable Abelian groups.Alexander G. Melnikov - 2014 - Bulletin of Symbolic Logic 20 (3):315-356,.details We provide an introduction to methods and recent results on infinitely generated abelian groups with decidable word problem. Download Export citation Bookmark 6 citations

Applied ethics	Epistemology	History of Western Philosophy	Meta-ethics	Metaphysics	Normative ethics
Philosophy of biology	Philosophy of language	Philosophy of mind	Philosophy of religion	Science Logic and Mathematics	More ...