Mathematics > Logic
arXiv:2606.01163 (math)
[Submitted on 31 May 2026]
Abstract: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.
Submission history
From: Mykyta Narusevych Mgr. [view email]
[v1]
Sun, 31 May 2026 11:11:12 UTC (17 KB)
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Code, Data, Media
Code, Data and Media Associated with this Article
Demos
Demos
Related Papers
Recommenders and Search Tools
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

























