arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.0158cs.LOcs.CC
收藏

关于无限对象规范等价的复杂性

On the Complexity of Equivalence of Specifications of Infinite Objects

Joerg Endrullis, Dimitri Hendriks, Rena Bakhshi

摘要:

我们研究的复杂性,决定平等的无限对象所指定的方程组,和无限对象所指定的非线性项。对于等式规范,有几个自然的相等概念:所有模型中的相等,解集的相等,以及生产规范的范式的相等。我们调查的Boehm-tree平等和各种概念的观察平等。我们在算术或分析层次中精确地指出了这些概念中每一个的复杂性。我们发现,在所有模型中决定平等的复杂性包含了整个分析层次。这已经适用于最简单的无限对象,即{0,1}上的流,并且与[Rosu 2006]中使用不同的相等概念导出的等式指定的流的相等的低算术Pi^0_2-完全性形成鲜明对比。

英文摘要:

We study the complexity of deciding the equality of infinite objects specified by systems of equations, and of infinite objects specified by lambda-terms. For equational specifications there are several natural notions of equality: equality in all models, equality of the sets of solutions, and equality of normal forms for productive specifications. For lambda-terms we investigate Boehm-tree equality and various notions of observational equality. We pinpoint the complexity of each of these notions in the arithmetical or analytical hierarchy. We show that the complexity of deciding equality in all models subsumes the entire analytical hierarchy. This holds already for the most simple infinite objects, viz. streams over {0,1}, and stands in sharp contrast to the low arithmetical Pi^0_2-completeness of equality of equationally specified streams derived in [Rosu 2006] employing a different notion of equality.

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

↑