证明树语言不是一阶可定义的
Proving that a Tree Language is not First-Order Definable
摘要:
我们探索从代数的角度与一阶公式涉及的祖先谓词的树语言定义的属性,使用这些语言的描述所识别的迭代块产品的森林代数定义从有限计数器monoid。不可定义性的证明是森林集合的无限序列,每一个都对应于定义相应语言种类的量化层次的层次结构。在给定级别的森林递归地建立从上一级插入森林在一个合适的一组多上下文的端口。我们表明,递归证明存在的语法代数的每一个不可定义的语言。我们还研究了某些类型的统一递归证明。为了这个目的,我们定义从森林代数的映射代数和一个扩展的代数,我们也用它来重新定义的概念,推广现有的非周期性。
英文摘要:
We explore from an algebraic viewpoint the properties of the tree languages definable with a first-order formula involving the ancestor predicate, using the description of these languages as those recognized by iterated block products of forest algebras defined from finite counter monoids. Proofs of nondefinability are infinite sequences of sets of forests, one for each level of the hierarchy of quantification levels that defines the corresponding variety of languages. The forests at a given level are built recursively by inserting forests from previous level at the ports of a suitable set of multicontexts. We show that a recursive proof exists for the syntactic algebra of every non-definable language. We also investigate certain types of uniform recursive proofs. For this purpose, we define from a forest algebra an algebra of mappings and an extended algebra, which we also use to redefine the notion of aperiodicity in a way that generalizes the existing ones.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。