REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION
DOI10.1017/jsl.2016.17zbMath1422.03018arXiv1510.03106OpenAlexW2963871219MaRDI QIDQ4977220
Stephen G. Simpson, Kostas Hatzikiriakou
Publication date: 3 August 2017
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.03106
group ringsreverse mathematicsYoung diagramsascending chain conditionpartition theorywell partial orderings
Combinatorial aspects of partitions of integers (05A17) Group rings (16S34) Group rings of finite groups and their modules (group-theoretic aspects) (20C05) Foundations of classical theories (including reverse mathematics) (03B30) Recursive ordinals and ordinal notations (03F15) Noetherian rings and modules (associative rings and algebras) (16P40)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Categorical characterizations of the natural numbers require primitive recursion
- Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
- The group algebra of the infinite symmetric group
- Well quasi-ordered sets and ideals in free semigroups and algebras
- A note on ordinal numbers and rings of formal power series
- Reverse mathematics and Peano categoricity
- Paul Gordan
- Baire categoricity and \(\Sigma_1^0\)-induction
- Algebraic disguises of \(\Sigma ^ 0_ 1\) induction
- Antichains of monomial ideals are finite
- Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
- Free Group Rings
- Partial realizations of Hilbert's program
- Ordinal numbers and the Hilbert basis theorem
- Orderings of monomial ideals
- On the strength of Ramsey's theorem without Σ1‐induction
- TOWARD OBJECTIVITY IN MATHEMATICS
This page was built for publication: REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION