Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T23:31:32.818Z Has data issue: false hasContentIssue false

FINITELY GENERATED GROUPS AND FIRST-ORDER LOGIC

Published online by Cambridge University Press:  24 May 2005

A. MOROZOV
Affiliation:
Sobolev Institute of Mathematics, Koptyug prosp. 4, Novosibirsk 630090, Russia, morozov@math.nsc.ru
A. NIES
Affiliation:
University of Auckland, Auckland, New Zealand, nies@math.uchicago.edu

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

It is proved that the following classes of finitely generated groups have $\Pi_1^1$-complete first-order theories: all finitely generated groups, the $n$-generated groups, and the strictly $n$-generated groups ($n\,{\geqslant}\,2$). Moreover, all those theories are distinct. Similar techniques show that quasi-finitely axiomatizable groups have a hyperarithmetical word problem, where a finitely generated group is quasi-finitely axiomatizable if it is the only finitely generated group satisfying an appropriate first-order sentence. The Turing degrees of word problems of quasi-finitely axiomatizable groups form a cofinal set in the Turing degrees of hyperarithmetical sets.

Information

Type
Notes and Papers
Copyright
The London Mathematical Society 2005