arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.08998math.LO
收藏

典型强迫、NP搜索问题及Riis定理的推广

Typical forcings, NP search problems and an extension of a theorem of Riis

Moritz Müller

摘要:

我们定义了典型的强迫包括许多非正式的强迫参数有界算术,并给出了一般条件,这样的强迫产生模型的相对化$T^1_2$的普遍变体。我们应用这一结果来研究总(2型)NP搜索问题的相对复杂性有限组合原则。复杂性理论将这些问题与多项式时间多-一或图灵归约进行比较。从逻辑的角度来看,这些问题是根据证明其整体性的有界算术理论进行分级的。还原的逻辑类比是从一个问题的总体证明另一个问题的总体。这两种观点之间的联系是紧密的,我们称之为相对化有界算术的普遍变体。我们加强了Buss和Johnson(2012)的一个定理,该定理从多项式时间图灵约简中推断出相对有界深度的总体性弗雷格证明。作为一般力迫法的应用,我们导出了Riis有限化定理(1993)的一个强形式。我们扩展它表现出一个简单的模型理论的属性,这意味着独立的相对化$T^1_2$加上弱鸽子原理的普遍变体。更一般地说,我们表明,相对化的$T^1_2$的普遍变体并不证明(总NP搜索问题的整体)从一个弱的强有限组合原则。弱或强是简单的模型论性质,其基础是原理在有限结构中的行为,而有限结构只是部分定义的。

英文摘要:

We define typical forcings encompassing many informal forcing arguments in bounded arithmetic and give general conditions for such forcings to produce models of the universal variant of relativized $T^1_2$. We apply this result to study the relative complexity of total (type 2) NP search problems associated to finitary combinatorial principles. Complexity theory compares such problems with respect to polynomial time many-one or Turing reductions. From a logical perspective such problems are graded according to the bounded arithmetic theories that prove their totality. The logical analogue of a reduction is to prove the totality of one problem from the totality of another. The link between the two perspectives is tight for what we call universal variants of relativized bounded arithmetics. We strengthen a theorem of Buss and Johnson (2012) that infers relative bounded depth Frege proofs of totality from polynomial time Turing reducibility. As an application of our general forcing method we derive a strong form of Riis' finitization theorem (1993). We extend it by exhibiting a simple model-theoretic property that implies independence from the universal variant of relativized $T^1_2$ plus the weak pigeonhole principle. More generally, we show that the universal variant of relativized $T^1_2$ does not prove (the totality of the total NP search problem associated to) a strong finitary combinatorial principle from a weak one. Being weak or strong are simple model-theoretic properties based on the behaviour of the principles with respect to finite structures that are only partially defined.

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

↑