arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2203.10237math.LO
收藏

关于若干在$V^{0}$上推广计数原理的$Σ^{B}_{0}$-公式

On some $Σ^{B}_{0}$-formulae generalizing counting principles over $V^{0}$

Eitetsu Ken

AI总结:

该研究在有界算术系统$V^0$框架下形式化多种计数原理,提出三类计数相关组合原理的相互独立性猜想,并通过改进赋值方法、归约为多项式存在性问题给出证明的充分条件,推进了有界算术证明强度研究。

摘要:

我们对多种计数原理进行形式化,并比较它们在$V^{0}$上的强度。具体而言,我们提出以下关于相互独立性的猜想:(1)一致版本的模计数原理与单射鸽巢原理之间相互独立;(2)某一版本的oddtown定理与模为$p$的模计数原理之间相互独立,其中$p$是任意非2的幂的自然数;(3)某一版本的Fisher不等式与模计数原理之间相互独立。\n 随后,我们给出了证明这些猜想的充分条件。我们对$PHP$-树和$k$-赋值的概念进行了变体构造,以证明:任何将一致计数原理作为公理模式的单射鸽巢原理的Frege证明,都不可能具有$o(n)$-赋值。对于剩下的两个猜想,我们利用熟知的$p$-树和$k$-赋值概念,将问题归约为是否存在特定的多项式族,这些多项式族能从相关模计数原理的不成立出发,以低次数Nullstellensatz证明见证对应组合原理的不成立。

英文摘要:

We formalize various counting principles and compare their strengths over $V^{0}$. In particular, we conjecture the following mutual independence between: (1) a uniform version of modular counting principles and the pigeonhole principle for injections, (2) a version of the oddtown theorem and modular counting principles of modulus $p$, where $p$ is any natural number which is not a power of $2$, (3) and a version of Fisher's inequality and modular counting principles. Then, we give sufficient conditions to prove them. We give a variation of the notion of $PHP$-tree and $k$-evaluation to show that any Frege proof of the pigeonhole principle for injections admitting the uniform counting principle as an axiom scheme cannot have $o(n)$-evaluations. As for the remaining two, we utilize well-known notions of $p$-tree and $k$-evaluation and reduce the problems to the existence of certain families of polynomials witnessing violations of the corresponding combinatorial principles with low-degree Nullstellensatz proofs from the violation of the modular counting principle in concern.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑