The automorphism tower problem revisited

Winfried Just, Saharon Shelah, Simon Thomas

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


It is well known that the automorphism towers of infinite centreless groups of cardinality κ terminate in less than (2κ)+ steps. But an easy counting argument shows that (2κ)+ is not the best possible bound. However, in this paper, we will show that it is impossible to find an explicit better bound using ZFC.

Original languageEnglish (US)
Pages (from-to)243-265
Number of pages23
JournalAdvances in Mathematics
Issue number2
StatePublished - Dec 25 1999

All Science Journal Classification (ASJC) codes

  • Mathematics(all)


Dive into the research topics of 'The automorphism tower problem revisited'. Together they form a unique fingerprint.

Cite this