完全二叉树的量词消去

刘吉强;廖东升;罗里波

数学学报 ›› 2003, Vol. 46 ›› Issue (1) : 95-102.

数学学报 ›› 2003, Vol. 46 ›› Issue (1) : 95-102. DOI: 10.12386/A2003sxxb0013
论文

完全二叉树的量词消去

    刘吉强;廖东升;罗里波
作者信息 +

Quantifier Elimination for Complete Binary Trees

    Ji Qiang LIU(1),Dong Sheng LIA
Author information +
文章历史 +

摘要

量词消去法已经成为计算机科学和代数模型论中最有力的研究工具之一.本 文针对完全二叉树理论所独有的特性,给出了它的基本公式集,然后利用分布公式及 有限覆盖证明了完全二叉树的理论可以量词消去.

Abstract

The method of quantifier elimination has been one of the powerful tools in the computer science and algebraic model theory. In this article, we deal with the theory of complete binary trees. After givling a set of fomulas as the Basic Formulas, we use the layout formulas and finite covering to prove that the theory of complete binary trees admits quantifier elimination.

关键词

量词消去 / 完全二叉树 / 基本公式 / 分布公式 / 有限覆盖

引用本文

导出引用
刘吉强;廖东升;罗里波. 完全二叉树的量词消去. 数学学报, 2003, 46(1): 95-102 https://doi.org/10.12386/A2003sxxb0013
Ji Qiang LIU(1),Dong Sheng LIA. Quantifier Elimination for Complete Binary Trees. Acta Mathematica Sinica, Chinese Series, 2003, 46(1): 95-102 https://doi.org/10.12386/A2003sxxb0013

Accesses

Citation

Detail

段落导航
相关文章

/