arXiv (All)
open access
Propositional formula minimization is $Σ_2^p$-complete under many-one reductions
The Minimum Equivalent Expression problem (MEE) asks, given a propositional formula $ϕ$ and an integer $k$, whether $ϕ$ is equivalent to a formula with at most $k$ occurrences of propositional variables. While the problem is clearly in $Σ_2^p$, its completeness under polynomial-time many-one reducti
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
- The Basics of Display Calculi#749940
- The Semantics of Entailment#764262
- Towards Tractable Approximations to Many-Valued Logics: the Case of First Degree Entailment#104847
- Definite Descriptions in Intuitionist Positive Free Logic#746178
- Algorithmic Aspects of Todas Theorem#1034672
Record · ID 1457670
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