pith. sign in

arxiv: 2602.24285 · v2 · pith:BKIC4G3Unew · submitted 2026-02-27 · 🧮 math.CO · math.LO

Untranscendable order types

classification 🧮 math.CO math.LO
keywords indecomposabletypeuntranscendableeverytypesadditivelyanaloguecall
0
0 comments X
read the original abstract

We introduce and study a multiplicative analogue of additive indecomposability for linear order types that we call untranscendability, as well as a strengthening that we call $s$-untranscendability. We show that, with the unique exception of the two-point type, every untranscendable type is additively indecomposable, and every $\sigma$-scattered untranscendable type is strongly indecomposable. Under the Proper Forcing Axiom, every untranscendable Aronszajn type is strongly indecomposable. We also show that a theorem of Hagendorf and Jullien, that every strictly additively indecomposable type must be strictly indecomposable to either the left or right, has a natural analogue for $s$-untranscendable types.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.