期刊文献+

可量词消去的带根节点的树理论

The Classification of All Quantifier-Eliminable Directed or Undirected Trees with a Root
原文传递
导出
摘要 讨论了带根节点r的有向树、无向树理论的量词消去性质,找到决定理论量词消去的三类特殊公式,并给出了在语言■_0={E,r}(E为有向边或无向边)及添加二元距离关系D_(n,n)<w所得膨胀语言下,可量词消去的这两类理论的完全分类. We put forward three special formulas to describe the structural characteristics of directed or undirected trees with a root.On this basis,quantifier elimination property for directed or undirected trees with root r in the language L0= {E,r} and its expansion is discussed and four classification results are proposed.
出处 《数学学报(中文版)》 SCIE CSCD 北大核心 2015年第4期691-704,共14页 Acta Mathematica Sinica:Chinese Series
基金 国家自然科学基金(61304155 11401015 11101012) 北京市高校创新人才项目(201306206) 北京市教委面上项目(KM201510011001) 北京工商大学青年教师科研启动基金(QNJJ2014-27)
关键词 量词消去 有向树 无向树 quantifier elimination directed trees undirected trees
  • 相关文献

参考文献16

  • 1Chen L.,Shen F.X.,The CB rank of the elements in complete binary trees,Acta Mathematica Sinica,Chinese Series,2005,48(2):245-250.
  • 2Chen L.,Shen F.X.,A countable model for the theory of complete dense binary order,Journal of Beijing Normal University,Natural Science,2007,43(2):111-113(in Chinese).
  • 3Chen L.,Shen F.X.,The quantifier elimination of dense binary orders theory(1),Journal of Beijing Normal University,Natural Science,2008,44(6):568-572(in Chinese).
  • 4Feigner U.,The classification of all quantifier-eliminable FC-groups,Atti del Congresso Logica e Filosofia della Scienza,oggi',San Gimignano,1983,1:27-33.
  • 5Fu Y.Y.,Shen F.X.,Wu M.N.,A new proof of quantifier elimination of complete forked trees,Journal of Nanjing University Mathematical Biquarterly,2007,24(2):204-212(in Chinese).
  • 6Fu Y.Y.,Shen F.X.,Wu M.N.,New proof for quantifier elimination of complete dense binary orders,Journal of Beijing Normal University,Natural Science,2008,44(2):111-114(in Chinese).
  • 7Fu Y.Y.,Shen F.X.,The classification of all quantifier-eliminable treelike partial orderings with a least element,Acta Mathematica Sinica,Chinese Series,2014,57(6):1171-1180.
  • 8Li Z.M.,Luo L.B.,Li X.,On the computational complexity of the theory of complete binary trees,Acta Mathematica Sinica,Chinese Series,2008,51(2):311-318.
  • 9Liu J.Q.,Liao D.S.,Luo L.B.,Quantifier elimination for complete binary trees,Acta Mathematica Sinica,Chinese Series,2003,46(1):95-102.
  • 10Macintyre A.,McKenna K.,Lou van den D.,Elimination of quantifiers in algebraic structures,Advances in Math.,1983,47:74-87.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部