Reverse Mathematics and Dimension of Posets

Abstract

Order dimension theory measures the complexity of partially ordered sets by quantifying how far they are from being linearly ordered. In this paper we study classical bounding results for order dimension within the framework of reverse mathematics. We focus on principles asserting that the dimension of a poset can be bounded in terms of the dimension of subposets obtained by removing chains or points, denoted by $\mathsf{DBi_n}$, $\mathsf{DBc_n}$, and $\mathsf{DB_p}$. We prove that, over $\mathsf{RCA}_0$, both $\mathsf{DBi_n}$ and $\mathsf{DBc_n}$ are equivalent to $\mathsf{WKL}_0$. To analyze $\mathsf{DB_p}$, we introduce a natural strengthening $\mathsf{DB^+_p}$ and show that both $\mathsf{DB_p}$ and $\mathsf{DB^+_p}$ are provable from $\mathsf{WKL}_0$ and from $\mathsf{I}Σ^0_2$, while $\mathsf{B}Σ^0_2$ does not suffice to prove $\mathsf{DB^+_p}$. The latter result is obtained by showing that the statement \lq\lq $\mathsf{DB^+_p}$ is computably true\rq\rq\ is equivalent to $\mathsf{I}Σ^0_2$.

Theorems & Definitions (58)

• Theorem 1
• Theorem 2
• Theorem 2.1
• Definition 2.2
• Theorem 2.3: $\mathsf{RCA}_0$
• proof
• Theorem 2.4: $\mathsf{RCA}_0$
• proof
• Theorem 2.5: $\mathsf{RCA}_0$
• Corollary 2.6: $\mathsf{WKL}_0$