Harry J. Altman

activity

20122026

most citedInteger complexity: The integer defect

3 citations · 7 across the 5 of their papers we have counts for

collaborators

Showing math.LOShow all

3 papers · 1 filter

math.LO2024★ 1 cited

Bounding finite-image sequences of length $ω^{k}$

Harry Altman

Given a well-quasi-order $X$ and an ordinal $α$ , the set $s_{α}^{F} (X)$ of transfinite sequences on $X$ with length less than $α$ and with finite image is also a well-quasi-order, as p…

math.LO2019

Maximum linearizations of lower sets in $N^{m}$ with application to monomial ideals

Harry Altman, Andreas Weiermann

We compute the type (maximum linearization) of the well partial order of bounded lower sets in $N^{m}$ , ordered under inclusion, and find it is $ω^{ω^{m - 1}}$ . Moreover we co…

math.LO2015

Intermediate arithmetic operations on ordinal numbers

Harry Altman

There are two well-known ways of doing arithmetic with ordinal numbers: the "ordinary" addition, multiplication, and exponentiation, which are defined by transfinite iteration; and…

Bounding finite-image sequences of length ωk

Maximum linearizations of lower sets in Nm with application to monomial ideals

Intermediate arithmetic operations on ordinal numbers

Bounding finite-image sequences of length $ω^{k}$

Maximum linearizations of lower sets in $N^{m}$ with application to monomial ideals