MIN原理与PHP原理的独立性
An independence of the MIN principle from the PHP principle
AI总结:
本文研究了bounded arithmetic中MIN原理与PHP原理的独立性,证明了在加入所有Δ^b_1(△)公式的PHP实例后,T^1_2(△)理论无法证明MIN(△)原理。
摘要:
在限定算术中研究的最小化原理$\textsf{MIN}(\triangleleft)$指出,任何有限区间$[0,\dots,n)$上的严格线性序$\triangleleft$都有最小元素。本文证明,当在有界算术理论$\textsf{T}^1_2(\triangleleft)$中加入所有$Δ^b_1(\triangleleft)$公式的鸽巢原理实例后,该理论无法证明$\textsf{MIN}(\triangleleft)$原理。
英文摘要:
The minimization principle $\textsf{MIN}(\triangleleft)$ studied in bounded arithmetic says that a strict linear ordering $\triangleleft$ on any finite interval $[0,\dots,n)$ has the minimal element. We shall prove that bounded arithmetic theory $\textsf{T}^1_2(\triangleleft)$ augmented by instances of the pigeonhole principle for all $Δ^b_1(\triangleleft)$ formulas does not prove $\textsf{MIN}(\triangleleft)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。