Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913177062604800 |
|---|---|
| author | Narusevych, Mykyta |
| author_facet | Narusevych, Mykyta |
| contents | We formulate a factorization hypothesis for linear orders definable by oracle polynomial-time machines. Assuming this hypothesis, we provide an approach to constructing a nonstandard model satisfying the minimization scheme for polynomial-time predicates while violating the tournament principle for graphs with polynomial-time edge relation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2606_01163 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic Narusevych, Mykyta Logic We formulate a factorization hypothesis for linear orders definable by oracle polynomial-time machines. Assuming this hypothesis, we provide an approach to constructing a nonstandard model satisfying the minimization scheme for polynomial-time predicates while violating the tournament principle for graphs with polynomial-time edge relation. |
| title | Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic |
| topic | Logic |
| url | https://arxiv.org/abs/2606.01163 |