A bounded-existential MRDP fragment and a certificate-growth audit
Statement
Question 2 (D'Aquino). Is DPRM a theorem of I∆0? This is Peano arithmetic with the induction axiom for every first order formula ϕ(x) with bounded quantifiers
I(ϕ):
[
ϕ(0) ∧ (∀x)(ϕ(x) → ϕ(x + 1) )]
→ (∀x)(ϕ(x))
A positive answer would imply that NP is equal to co-NP. Given a Σ1 formula ψ(~x), does there exist a polynomial P (~x, ~ y) such that
I∆0 ` (∀~x)
(
ψ(~x) ↔ (∃~y)(P (~x, ~ y) = 0 ))
Consider the language L = {+, ·, 0, 1, #, ≤}, where
#( x, y ):= xblog( y)c
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.