Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2203.10237 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929420765233152 |
|---|---|
| author | Ken, Eitetsu |
| author_facet | Ken, Eitetsu |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2203_10237 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | On some $Σ^{B}_{0}$-formulae generalizing counting principles over $V^{0}$ Ken, Eitetsu Logic 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. |
| title | On some $Σ^{B}_{0}$-formulae generalizing counting principles over $V^{0}$ |
| topic | Logic |
| url | https://arxiv.org/abs/2203.10237 |