素数阶群理论的量词消去算法及其上界

在以前的一些工作中,作者已经证明语言(?)={+,0,e)上素数阶群的理论T有量词消去性质并研究了它的判定问题的复杂性.本文在此基础上将利用T的判定问题的复杂性结果给出理论T的量词消去的一个算法,同时给出该算法的复杂性上界.     

可量词消去的树形偏序理论的分类

提出了偏序的全序片段、序模式的概念以刻画树形偏序的结构特征,以此为基础,讨论了有最小元0的树形偏序理论的量词消去性质,给出了在语言(?)_0={,0}及其膨胀语言下可以量词消去的这类理论的完全分类。     

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

讨论了带根节点r的有向树、无向树理论的量词消去性质,找到决定理论量词消去的三类特殊公式,并给出了在语言■_0={E,r}(E为有向边或无向边)及添加二元距离关系D_(n,n)w所得膨胀语言下,可量词消去的这两类理论的完全分类.     

素数阶群理论的量词消去及复杂性

本文中我们将研究语言,上素数阶群理论Ｔ的量词消去及相应的复杂性．我们证明理论Ｔ有量词消去性质,并利用该性质给出理论Ｔ判定问题的一个复杂性上界．     

完全二叉树理论的计算复杂度

完全二叉树的一阶理论已被证明具有量词消去的性质,进而计算了完全二叉树模型中元素的CB秩.本文利用有界Ehrenfeucht-Frassé博弈研究完全二叉树的一阶理论,证明了此理论的时间计算复杂度上界为22cn,空间计算复杂度上界为2dn(其中n为输入长度,c,d为合适的常数).     

完全二叉树模型中元素的CB秩

本文以完全二叉树理论的可量词消去为基础,介绍了该理论的可数原子模型 及饱和模型,并计算了一元、二元完全型的CB秩,从而给出了CB秩在该理论中的 几何解释.     

完全二叉树模型中元素的CB秩

本文以完全二叉树理论的可量词消去为基础,介绍了该理论的可数原子模型 及饱和模型,并计算了一元、二元完全型的CB秩,从而给出了CB秩在该理论中的 几何解释.     

直觉主义量词模态逻辑系统MIPC~*的可靠性定理

设WMμ为系统MIPC*全部公式的集,再设г∪{A} WMμ,则гMIPC* A意义明显.而 M A指гM-蕴涵A.以前已证明гM A гMIPC*A,即MIPC*为强完全的.本文证明其逆定理成立,即гMIPC*A гM A.是为MIPC*的可靠性定理.     

推广的韩-刘-张反常消去公式

在[Anomaly cancellation and modularity, Frontiers in Differential Geometry, Partial Differential Equations and Mathematical Physics,2014:87-104,World Sci.Publ.,Hackensack,NJ]中,韩-刘-张给出了一个反常消去公式,推广了GreenSchwarz公式和Schwartz-Witten公式.本文研究了两个推广的韩-刘-张公式和一个奇数维的韩-刘-张公式.通过研究一些示性式的模性质,给出了奇数维新的反常消去公式.     

消去图、覆盖图和均匀图的若干结果

设 G是一个图 ,g,f是定义在图 G的顶点集上的两个整数值函数 ,且g≤f.图 G的一个 ( g,f) -因子是 G的一个支撑子图 F,使对任意的 x∈V( F)有g( x)≤ d F( x)≤ f ( x) .文中推广了 ( g,f) -消去图、( g,f ) -覆盖图和 ( g,f) -均匀图的概念 ,给出了在 g相似文献   

Non‐effective Quantifier Elimination

Genera connections between quantifier elimination and decidability for first order theories are studied and exemplified.     

Simplicial Properties of the Set of Planar Binary Trees

Planar binary trees appear as the the main ingredient of a new homology theory related to dialgebras, cf.(J.-L. Loday, C.R. Acad. Sci. Paris 321 (1995), 141–146.) Here I investigate the simplicial properties of the set of these trees, which are independent of the dialgebra context though they are reflected in the dialgebra homology.The set of planar binary trees is endowed with a natural (almost) simplicial structure which gives rise to a chain complex. The main new idea consists in decomposing the set of trees into classes, by exploiting the orientation of their leaves. (This trick has subsequently found an application in quantum electrodynamics, c.f. (C. Brouder, On the Trees of Quantum Fields, Eur. Phys. J. C12, 535–549 (2000).) This decomposition yields a chain bicomplex whose total chain complex is that of binary trees. The main theorem of the paper concerns a further decomposition of this bicomplex. Each vertical complex is the direct sum of subcomplexes which are in bijection with the planar binary trees. This decomposition is used in the computation of dialgebra homology as a derived functor, cf. (A. Frabetti, Dialgebra (co) Homology with Coefficients, Springer L.N.M., to appear).     

Quantifier elimination for the theory of algebraically closed valued fields with analytic structure

The theory of algebraically closed non‐Archimedean valued fields is proved to eliminate quantifiers in an analytic language similar to the one used by Cluckers, Lipshitz, and Robinson. The proof makes use of a uniform parameterized normalization theorem which is also proved in this paper. This theorem also has other consequences in the geometry of definable sets. The method of proving quantifier elimination in this paper for an analytic language does not require the algebraic quantifier elimination theorem of Weispfenning, unlike the customary method of proof used in similar earlier analytic quantifier elimination theorems. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Left and Right Length of Paths in Binary Trees or on a Question of Knuth

We consider extended binary trees and study the joint right and left depth of leaf j, where the leaves are labelled from left to right by 0, 1, . . . , n, and the joint right and left external pathlength of binary trees of size n. Under the random tree model, i.e., the Catalan model, we characterize the joint limiting distribution of the suitably scaled left depth and the difference between the right and the left depth of leaf j in a random size-n binary tree when j ~ ρn with 0 < ρ > 1, as well as the joint limiting distribution of the suitably scaled left external pathlength and the difference between the right and the left external pathlength of a random size-n binary tree. This work was supported by the Austrian Science Foundation FWF, grant S9608-N13.     

Quantifier elimination for elementary geometry and elementary affine geometry

We introduce new first‐order languages for the elementary n‐dimensional geometry and elementary n‐dimensional affine geometry (n ≥ 2), based on extending $\mathsf {FO}(\beta ,\equiv )$ and $\mathsf {FO}(\beta )$, respectively, with new function symbols. Here, β stands for the betweenness relation and ≡ for the congruence relation. We show that the associated theories admit effective quantifier elimination.