完全相容稳定模糊谓词转换器

谓词转换器语义是用程序验证技术来定义程序语言的一种方式.为描述程序的语义,在稳定模糊谓词的基础上建立完全相容稳定模糊谓词转换器,讨论完全相容稳定模糊谓词转换器的拓扑语义. 同时给出它与状态转换器之间的一个保序关系,说明完全相容稳定模糊谓词转换器一定是状态转换器.     

SST—PM空间与拓扑空间之积上映射的不动点定理

本文利用作者[2]的结果给出 SST-PM 空间[1]与拓扑空间之积上映射的几个不动点定理,它们以张石生[3]中的某些主要结果为特例。     

不分明化sp-拓扑空间及范畴FSPTop的拓扑性

基于连续逻辑值语义,研究了不分明化sp-拓扑空间,讨论了不分明化的sp-开集,sp-邻域,sp-闭包及sp-内部等性质,给出了不分明化sp-连续映射的概念,引入了范畴FSPTop,证明了范畴FSPTop是范畴Set上的拓扑范畴。     

非Lipschitz仿射映射的半拓扑半群的强遍历定理

本文在Ｂａｎａｃｈ空间中给出了Ｌｉｐｓｃｈｉｔｚｉａｎ仿射拓扑半群的强遍历定理。     

L—Fuzzy拓扑空间中的可数SR—紧性

从层次结构入手引入L－fuzzy拓扑空间中的可数SR－紧性,证明了可数SR－紧性对强半闭子集遗传,可数SR－紧子集在S－不定映射 像保持,给出了可数SR－紧性的几何刻画与有限交性质的刻画。     

取值于序拓扑向量空间的映射与层空间

In the paper [Monotone countable paracompactness and maps to ordered topological vector spaces, Top. Appl., 2014, 169(3): 51–70], Yamazaki initiated the study on maps with values into ordered topological vector spaces. Characterizations of monotonically countably paracompact spaces and some other spaces in terms of maps to ordered topological vector spaces were obtained. In this paper, following Yamazaki's method, we present some characterizations of stratifiable spaces and k-semi-stratifiable spaces in terms of maps with values into ordered topological vector spaces.     

关于L-fuzzy拓扑分离性的弱同胚不变性质

本文研究了一种新的弱同胚不变性质，它更具有一般性；证明了目前文献中所论述的各种分离性都是弱同胚不变性质，并且否定回答了王国俊提出的两个分离性问题。     

Incompleteness Results in Kripke Bundle Semantics

Kripke bundle and C-set semantics are known as semantics which generalize standard Kripke semantics. In [4] and in [1, 2] it is shown that Kripke bundle and C-set semantics are stronger than standard Kripke semantics. Also it is true that C-set semantics for superintuitionistic logics is stronger than Kripke bundle semantics ([6]). Modal predicate logic Q-S4.1 is not Kripke bundle complete ([3] - it is also yielded as a corollary to Theorem 6.1(a) of the present paper). This is shown by using difference of Kripke bundle semantics and C-set semantics. In this paper, by using the same idea we show that incompleteness results in Kripke bundle semantics which are extended versions of [2].     

Predicate logics of expressively strong theories

It is proved that the logicL(T) coincides with the predicate calculus for the theory of rings, the theory of fields, group theory, and all arithmetically correct theoreies. Translated fromMatematicheskie Zametki, Vol. 66, No. 5, pp. 777–788, November, 1999.     

The Axiom of Choice in Second-Order Predicate Logic

The present article deals with the power of the axiom of choice (AC) within the second-order predicate logic. We investigate the relationship between several variants of AC and some other statements, known as equivalent to AC within the set theory of Zermelo and Fraenkel with atoms, in Henkin models of the one-sorted second-order predicate logic with identity without operation variables. The construction of models follows the ideas of Fraenkel and Mostowski. It is e. g. shown that the well-ordering theorem for unary predicates is independent from AC for binary predicates and from the trichotomy law for unary predicates. Moreover, we show that the AC for binary predicates follows neither from the trichotomy law for unary predicates nor from Zorn's lemma for unary predicates nor from the formalization of the axiom of choice for disjoint families of sets for binary predicates, and that the trichotomy law for unary predicates does not follow from AC for binary predicates. Mathematics Subject Classification: 03B15, 03E25, 04A25.     

A Topological Minimax Theorem

We present a topological minimax theorem (Theorem 2.2). The topological assumptions on the spaces involved are somewhat weaker than those usually found in the literature. Even when reinterpreted in the convex setting of topological vector spaces, our theorem yields nonnegligible improvements, for example, of the Passy–Prisman theorem and consequently of the Sion theorem, contrary to most results on topological minimax. This work is part of our ongoing effort to elaborate a coherent theory of minimax.     

Topological properties of asymptotically stable sets

Topological properties of the domain of attraction for dynamical systems are investigated. The main purpose of this paper is to prove that a compact, asymptotically stable attractor of a dynamical system defined on a locally compact metric space is a deformation retract of its domain of attraction, in a weak sense that is made precise. Under additional local assumptions, the attractor can be shown to be a retract, a deformation retract, or a strong deformation retract. The well known result that the domain of attraction of an asymptotically stable equilibrium is contractible follows as a corollary.