arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2604.04830cs.CCmath.LO
收藏

强可行析取性质的失效

Failure of the strong feasible disjunction property

Charles University(查理大学)

Jan Krajicek

AI总结:

研究指出,在两个假设下,强可行析取性质在足够强的证明系统中不成立,结合了Ilango和Ren等人的工作及K的工具。

摘要:

一个命题证明系统P具有强可行析取性质当且仅当存在一个常数c≥1,使得当P能给出一个大小为s的证明证明∨α_i,并且任意两个α_i不共享原子时,其中一个α_i有P的证明大小≤s^c。我们结合Ilango (2025)和Ren等人 (2025)的工作,以及K (2007)的工具证明,在以下两个假设下排除了该性质:- 存在一个在类E中需要指数大小电路的语言,即使允许查询NP oracle;- 存在一个P/poly demi-bit,按照Rudich (1997)的意义。

英文摘要:

A propositional proof system $P$ has the strong feasible disjunction property iff there is a constant $c \geq 1$ such that whenever $P$ admits a size $s$ proof of $\bigvee_i α_i$ with no two $α_i$ sharing an atom then one of $α_i$ has a $P$-proof of size $\le s^c$. We combine the work of Ilango (2025) and Ren et al. (2025) with the gadget proof complexity generator of K. (2007) and rule out the property for strong enough proof systems under the following two hypotheses: - there exists a language in class E that requires exponential size circuits even if they are allowed to query an NP oracle, - there exists a P/poly demi-bit in the sense of Rudich (1997).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑