arXiv (All)
open access
NEXP-Completeness of Existential Presburger Arithmetic with Divisibility
We prove that satisfiability for existential Presburger arithmetic with divisibility (EPAD) is NEXP-hard. Together with the known NEXP upper bound, this establishes NEXP-completeness. The lower bound is obtained by encoding succinct Boolean formulas whose satisfying assignments may have exponential
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
- A Completenesss Theorem for a 3-Valued Semantics for a First-order Language#735944
- Quantified Propositional Gödel Logics#697298
- Vo inset#232985
- Logical Nihilism: Where the Disagreement Stems from#106799
- Existence and nonexistence of commutativity gadgets for entangled CSPs#1062636
Record · ID 1034192
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