Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T08:46:54.217Z Has data issue: false hasContentIssue false

Describing Groups

Published online by Cambridge University Press:  15 January 2014

André Nies*
Affiliation:
Department of Computer Science, Auckland University, Auckland, New Zealand, E-mail: andre@cs.auckland.ac.nz

Abstract

Two ways of describing a group are considered. 1. A group is finite-automaton presentable if its elements can be represented by strings over a finite alphabet, in such a way that the set of representing strings and the group operation can be recognized by finite automata. 2. An infinite f.g. group is quasi-finitely axiomatizable if there is a description consisting of a single first-order sentence, together with the information that the group is finitely generated. In the first part of the paper we survey examples of FA-presentable groups, but also discuss theorems restricting this class. In the second part, we give examples of quasi-finitely axiomatizable groups, consider the algebraic content of the notion, and compare it to the notion of a group which is a prime model. We also show that if a structure is bi-interpretable in parameters with the ring of integers, then it is prime and quasi-finitely axiomatizable.

Information

Type
Articles
Copyright
Copyright © Association for Symbolic Logic 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable