有标记反例的辩证解释
Dialectica Interpretation with Marked Counterexamples
摘要:
哥德尔的函数“辩证法”解释可以用来从算术中的非构造性证明中提取函数程序,方法是使用两种高阶证明项:正实现者和负反例。在最初的解释中,原子的可判定性是从一组候选者中计算出正确的反例所必需的。当与递归结合时,需要对提取程序中的每一步进行这种选择,然而,在某些特殊情况下,对否定证人的判决只能计算一次。我们提出了一个变种的解释,其中提取的程序的时间复杂度可以提高标记所选择的证人,从而避免重新计算。所获得的效果类似于使用一个失败的控制算子来解释非构造性原理的计算内容。
英文摘要:
Goedel's functional "Dialectica" interpretation can be used to extract functional programs from non-constructive proofs in arithmetic by employing two sorts of higher-order witnessing terms: positive realisers and negative counterexamples. In the original interpretation decidability of atoms is required to compute the correct counterexample from a set of candidates. When combined with recursion, this choice needs to be made for every step in the extracted program, however, in some special cases the decision on negative witnesses can be calculated only once. We present a variant of the interpretation in which the time complexity of extracted programs can be improved by marking the chosen witness and thus avoiding recomputation. The achieved effect is similar to using an abortive control operator to interpret computational content of non-constructive principles.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。