Hostname: page-component-7b7567c8c-slfcl Total loading time: 0 Render date: 2026-11-19T18:24:41.094Z Has data issue: false hasContentIssue false

REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION

Published online by Cambridge University Press:  19 June 2017

KOSTAS HATZIKIRIAKOU
Affiliation:
DEPARTMENT OF PRIMARY EDUCATION UNIVERSITY OF THESSALY ARGONAFTON & FILELLINON VOLOS 38221, GREECE E-mail: kxatzkyr@uth.gr
STEPHEN G. SIMPSON
Affiliation:
DEPARTMENT OF MATHEMATICS 1326 STEVENSON CENTER VANDERBILT UNIVERSITY NASHVILLE, TN 37240, USA URL: http://www.math.psu.edu/simpson E-mail: sgslogic@gmail.com
Rights & Permissions [Opens in a new window]

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.

Let S be the group of finitely supported permutations of a countably infinite set. Let $K[S]$ be the group algebra of S over a field K of characteristic 0. According to a theorem of Formanek and Lawrence, $K[S]$ satisfies the ascending chain condition for two-sided ideals. We study the reverse mathematics of this theorem, proving its equivalence over $RC{A_0}$ (or even over $RCA_0^{\rm{*}}$ ) to the statement that ${\omega ^\omega }$ is well ordered. Our equivalence proof proceeds via the statement that the Young diagrams form a well partial ordering.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2017