arXiv (All)
open access
An Oracle Separating Conjectures about Incompleteness in the Finite Domain
Pudlák [Pud17] lists several major conjectures from the field of proof complexity and asks for oracles that separate corresponding relativized conjectures. Among these conjectures are: - $\mathsf{DisjNP}$: The class of all disjoint NP-pairs does not have many-one complete elements. - $\mathsf{SA
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- GPT, the Counterexample Machine#798235
- GPT, the Counterexample Machine#796822
- Computational Individuation#720669
- Four SNSFL-Sub-Lemma Types Resolve 310 of 353 Erdős Problems: A Formal PNBA Identity Physics Domain-Neutral Structural Framework Markdown#229948
- MathAdv: What Theorem Provers Know, Reason, Formalize, and Generalize#785228
Record · ID 1014427
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive