arXiv (All)
open access
Feasible disjunction for random resolution
We show that a (stronger) version of random resolution has the feasible disjunction property. This is the first instance of a proof system not known to have feasible interpolation, which nevertheless has the feasible disjunction property.
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
- New Possibilities for Fair Algorithms#110761
- Compactness Principles for CSPs and the Axiom of Chocie#1118946
- Hardness of Sampling in Random Constraint Satisfaction Problems#350556
- A pragmatist challenge to constraint laws#116672
- A Reality Check of Language Models as Formalizers on Constraint Satisfaction Problems#635591
Record · ID 997605
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