理学 >>> 数学 >>> 数理逻辑与数学基础 >>> 公理集合论 >>>
搜索结果: 1-15 共查到知识库 公理集合论相关记录130条 . 查询时间(2.135 秒)
邻域粗糙集可以直接处理数值型数据,F-粗糙集是第一个动态粗糙集模型.针对动态变化的数值型数据,结合邻域粗糙集和F-粗糙集的优势,提出了F-邻域粗糙集和F-邻域并行约简.首先,定义了F-邻域粗糙集上下近似、边界区域;其次,在F-邻域粗糙集中提出了F-属性依赖度和属性重要度矩阵;根据F-属性依赖度和属性重要度矩阵分别提出了属性约简算法,证明了两种约简方法的约简结果等价;最后,比对实验在UCI数据集、真...
本文首先给出了集合为近似E-次类凸的等价刻画.其次,分别在锥具有紧基和弱紧基的条件下,获得了近似E-次类凸集值优化问题的E-Benson真有效元的Lagrange乘子定理.作为应用,获得了集值优化问题Benson真有效元的Lagrange乘子定理.最后,给出了集值优化问题E-鞍点的充分条件.
We prove a conjecture of Knutson asserting that the Schubert structure constants of the cohomology ring of a two-step flag variety are equal to the number of puzzles with specified borde...
Provability in product logic     Provability  product logic       2015/9/30
We sharpen H丩ajek乫s Completeness Theorem for theories extending predicate product logic, 儺佂. By relating provability in this system to embedding properties of ordered abelian groups we construct a ...
We present a general construction of a family of ordinal sums of a sequence of structures and prove an elimination theorem for the class of ordinal sums in an expanded language. From this we deduce...
A classification of BL-algebras.
In this paper, we study VC-minimal theories and explore related concepts. We first define the notion of convex orderablity and show that this lies strictly between VCminimality and dp-minimality. To...
Data compression and definability of types in stable and dependent formulas.
We show that any family of sets uniformly definable in an ominimal structure has an extended compression scheme of size equal to the number of parameters in the defining formula.
We introduce the concept of a locally finite abstract elementary class and develop the theory of excellence (with respect to disjoint ( !, k)-amalgamation) for such classes. From this we find...
Given a sequence {αn} in (0, 1) converging to a rational, we examine the model theoretic properties of structures obtained as limits of ShelahSpencer graphs G(m, m−αn ). We show that in most c...
We give an explicit AE-axiomatization of the almost sure theories of sparse random graphs G(n, n−α) of Shelah-Spencer. In the process we give a method of constructing extensions of graphs whos...
We characterize when the elementary diagram of a mutually algebraic structure has a model complete theory, and give an explicit description of a set of existential formulas to which every formula i...
We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory T is mutually algebraic if and only if it is weakly minimal and trivial if and only if n...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...