Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An introduction to computable model theory on groups and fields

An introduction to computable model theory on groups and fields Abstract We introduce the standard computable-model-theoretic concepts of a computable group and a computable field, and use them to illustrate the sorts of questions about groups and fields which computability theorists investigate. This article is intended for group theorists with some background in algorithmic questions, such as the undecidability of the word problem and the conjugacy problem for finitely presented groups. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups - Complexity - Cryptology de Gruyter

An introduction to computable model theory on groups and fields

Groups - Complexity - Cryptology , Volume 3 (1) – May 1, 2011

Loading next page...
 
/lp/de-gruyter/an-introduction-to-computable-model-theory-on-groups-and-fields-o4ZSYKb2Dg
Publisher
de Gruyter
Copyright
Copyright © 2011 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc.2011.002
Publisher site
See Article on Publisher Site

Abstract

Abstract We introduce the standard computable-model-theoretic concepts of a computable group and a computable field, and use them to illustrate the sorts of questions about groups and fields which computability theorists investigate. This article is intended for group theorists with some background in algorithmic questions, such as the undecidability of the word problem and the conjugacy problem for finitely presented groups.

Journal

Groups - Complexity - Cryptologyde Gruyter

Published: May 1, 2011

There are no references for this article.