BibTeX
CSL-JSON
MLA
Harvard
COMPUTABLE ABELIAN GROUPS
release_utyr6wtenjh5bg7vm4kkinsocu
by
ALEXANDER G. MELNIKOV
Published
in Bulletin of Symbolic Logic by Cambridge University Press (CUP).
2014 Volume 20, Issue 03, p315-356
Abstract
<jats:title>Abstract</jats:title>
We provide an introduction to methods and recent results on infinitely generated abelian groups with decidable word problem.
In application/xml+jats
format
Archived Files and Locations
application/pdf 507.0 kB
file_injiqyjmijeunaijqrdrt4yfr4
|
www.massey.ac.nz:80 (web) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links
oaDOI/unpaywall (OA fulltext)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar