一类Domain范畴及其笛卡儿闭子范畴

本文给出一类新的 Ｄｏｍａｉｎ范畴 ＡｌｇＤ■（即以代数 Ｄｏｍａｉｎ为对象,保逼近序的Ｓｃｏｔｔ连续函数为态射的范畴）及其满子范畴ＡｌｇＤ■（即以有底（最小元）的代数Ｄｏｍａｉｎ为对象,保逼近序的Ｓｃｏｔｔ连续函数为态射的范畴）,并且讨论它们的极大的笛卡儿闭的满子范畴．     

Domain投射空间的连续性

本文研究了Ｄｏｍａｉｎ理论中投射空间的性质．其主要结果是;若连续ｃｐｏＤ的投射空间是连续的,则 Ｄ必是代数 Ｄｏｍａｉｎ．进一步,若连续 ｃｐｏ Ｄ具有性质ｍ则其投射空间是连续 ｃｐｏ当且仅当Ｄ是代数Ｄｏｍａｉｎ并且所有由紧元构成的序稠链是单点集．     

诱导的I-fuzzy拓扑生成序空间

本文研究了模糊拓扑生成序空间与其诱导的I-fuzzy拓扑生成序空间之间的关系.利用三种Lowen映射内在关联的方法,引入了三种I-fuzzy拓扑生成序空间,建立了诱导的I-fuzzy拓扑生成序空间理论.获得了诱导的I-fuzzy拓扑与诱导的I-fuzzy拓扑生成序之间的从属关系.     

完全分配格上拓扑生成序的加细及其性质

在文[1]中,作者建立了完全分配格上的共生结构的一般理论,研究了余拓扑,拟一致和T结构的一致化结构。本文引进了完全分配格L上半拓扑生成序加细的概念,研究了其性质,得到了一系列重要的结论,为进一步研究完全分配格上拓扑共生结构的加细奠定了基础。     

局部凸I-拓扑线性空间的投影拓扑与投影极限

给出模糊线性序同态的某些性质. 在此基础上, 利用Katsaras意义下的局部凸I-拓扑线性空间概念的一个等价刻画, 引进并研究了新的投影拓扑与投影极限, 得到了与经典拓扑线性空间理论中相应定理相平行的结果, 改进和推广了严从华的结论.     

偏序集的内蕴拓扑连通性北大核心

从序与拓扑的交叉考虑,进一步研究偏序集在多种内蕴拓扑下的连通性和局部连通性.主要结果有:(1)一个偏序集是序连通的当且仅当它赋予Alexandrov拓扑是连通的,也当且仅当它赋予Scott拓扑是连通的;(2)每一偏序集赋予Alexandrov拓扑是局部连通的,每一偏序集赋予Scott拓扑是局部连通的;(3)如果拓扑空间的特殊化偏序集序连通,则该拓扑空间是连通的;(4)构造反例说明了存在偏序集赋予下拓扑后是连通空间,但该偏序集本身不是序连通的.     

Fuzzy拓扑共生结构与预序关系

A. Csáaszár在[1]中引入拓扑共生(Syntopogenous)结构的概念,将拓扑结构,邻近结构,一致结构适当地统一起来研究。近年来,A·K·Katsaras等人在[2,3,4]中分别提出Fuzzy序拓扑空间,Fuzzy拓扑共生空间的概念,给出了一些基本性质。在文[6]中,我们对以完全分配格L为值域的Fuzzy拓扑共生空间作了一些初步的讨论,得到包括它与L-fuzzy拓扑,邻近性,一致性的关系,连续性,连通性等的若干性质。本文将X上的L-fuzzy拓扑共生结构与X上的预序结构联系起来,讨论了L-fuzzy拓扑共生结构生成的预序,预序决定的L-fuzzy拓扑生成结构,以及递增(减)的L-fuzzy拓扑共生结构的性质;其它进一步的讨论将在随后的工作中给出。     

L—fuzzy拓扑向量空间的归纳拓扑

利用L－fuzzy拓扑向量空间理论^[1]-[6],本文研究了由L-fuzzy线性序同态族所确定的L－fuzzy归纳拓扑后一些性质,给出了由单一Luzzy线性序同态所确定的L-fuzzy归纳拓扑的一个特征刻划,利用此结果,证明了L-fuzzy拓扑向量空间的商空间亦是L-fuzzy拓扑向量空间。     

有序拓扑向量空间中的共鸣定理

本文研究有序拓扑向量空间中非线性映照的共鸣定理．对于取值于有序拓扑向量空间中的映照，利用序关系，引入了一类广泛的非线性映照．对于这类非线性映照，应用纲理论，并给出了关于点态序有界蕴涵一致序有界的共鸣定理．     

模糊共生结构的加细及其性质

介绍模糊拓扑,模糊邻近,模糊拟一致框架下的模糊(半)拓扑序、模糊共生结构的概念,研究模糊(半)拓扑序,模糊共生结构的加细,得到一些重要性质。     

组合拓扑方法在组合学和图论中的应用

本文介绍组合拓扑方法在图论和组合学中的应用，探索一些新的离散问题和连续问题的关系，介绍目前有关这方面的新结果及发展动向。本文主要介绍同调理论在图论中的应用，与图有关的复形及性质，不动点定理在离散问题中的应用等。文中提出了一些新结果及可供研究的新问题。     

拓扑学在模型论中的一个应用

本文利用拓扑学方法研究了ω-范畴理论的性质，并对模型个数问题进行了讨论，获得了ω-范畴的新结果，并得到了关于模型个数的几个结果．     

Periodic solutions for neutral coupled oscillators network with feedback and time-varying delay

This paper is considered to be about the existence of periodic solutions for neutral coupled oscillators network with feedback control and time-varying delay (NCONFT). Based on the systematic method which is firstly applied for NCONFT and consisting of coincidence degree theory, graph theory, and Lyapunov method, some sufficient criteria are obtained to verify the existence of periodic solutions for NCONFT. What’s more, how coupling topology, feedback control, and time-varying delay affect the existence of periodic solutions for NCONFT can be shown by these sufficient criteria. Finally, a numerical simulation is offered to illustrate the effectiveness of our results.     

Deformation theorems on non‐metrizable vector spaces and applications to critical point theory

Let E be a Banach space and Φ : E → ? a ??¹‐functional. Let ?? be a family of semi‐norms on E which separates points and generates a (possibly non‐metrizable) topology ??_?? on E weaker than the norm topology. This is a special case of a gage space, that is, a topological space where the topology is generated by a family of semi‐metrics. We develop some critical point theory for Φ : (E, ??) → ?. In particular, we prove deformation lemmas where the deformations are continuous with respect to ??_??. In applications this yields a gain in compactness when Φ does not satisfy the Palais–Smale condition because one can work with the weak topology. We also prove some foundational results on gage spaces. In particular, we introduce the concept of Lipschitz continuity in this setting and prove the existence of Lipschitz continuous partitions of unity. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Mutual definability does not imply definitional equivalence,a simple example

We give two theories, Th₁ and Th₂, which are explicitly definable over each other (i.e. the relation symbols of one theory are explicitly definable in the other, and vice versa), but are not definitionally equivalent. The languages of the two theories are disjoint. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Optimal discrete Morse functions for 2-manifolds

Morse theory is a powerful tool in its applications to computational topology, computer graphics and geometric modeling. It was originally formulated for smooth manifolds. Recently, Robin Forman formulated a version of this theory for discrete structures such as cell complexes. It opens up several categories of interesting objects (particularly meshes) to applications of Morse theory. Once a Morse function has been defined on a manifold, then information about its topology can be deduced from its critical elements. The main objective of this paper is to introduce a linear algorithm to define optimal discrete Morse functions on discrete 2-manifolds, where optimality entails having the least number of critical elements. The algorithm presented is also extended to general finite cell complexes of dimension at most 2, with no guarantee of optimality.     

Extra Theory Morphisms for Institutions: Logical Semantics for Multi-Paradigm Languages

We extend the ordinary concept of theory morphism in institutions to extra theory morphisms. Extra theory morphisms map theories belonging to different institutions across institution morphisms. We investigate the basic mathematical properties of extra theory morphisms supporting the semantics of logical multi-paradigm languages, especially structuring specifications (module systems) á la OBJ-Clear. They include model reducts, free constructions (liberality), co-limits, model amalgamation (exactness), and inclusion systems.We outline a general logical semantics for languages whose semantics satisfy certain logical principles by extending the institutional semantics developed within the Clear-OBJ tradition. Finally, in the Appendix, we briefly illustrate this with the concrete example of CafeOBJ.     

NON-ARCHIMEDEAN PROBABILITY: FREQUENCY AND AXIOMATICS THEORIES

ＡＮＤＲＥＩＫＨＲＥＮＮＩＫＯＶ（ＤｅｐａｒｔｍｅｎｔｏｆＨｉｇｈＭａｔｈｅｍａｔｉｃｓ，ＭｏｓｃｏｗＩｎｓｔｉｔｕｔｅｏｆＥｌｅｃｔｒｏｎｉｃＥｎｇｉｎｅｅｒｉｎｇ，１０３４９８，Ｍｏｓｃｏｗ，Ｋ－４９８，Ｒｕｓｓｉａｎ）（Ｔｈｉｓｗｏｒｋｉｓｓｕ...     

Neural languages

In order to provide the theoretical framework necessary to study the neural mechanisms underlying languages, we present here a mathematical formalization of some neural behaviors. In such a context: (i) the neuron is defined as a coupling of automata, dealing with the transduction and codifying processes; (ii) the coupling between neurons is measured by a membership relation defined as the ratio between the transmitted and the system entropies; (iii) the attention given to the messages arriving at the system is considered as the difference between the couplings of the excitatory and inhibitory pools of neurons; (iv) the graphs in the neural systems are described by means of these couplings and, finally (v) the semantic productions are described by the fuzzy formal languages accepted by the automata formalized on these graphs. In such a way, both the verbal and neural semantics can now be correlated and experimentally investigated.     

From finitary to infinitary second‐order logic

A back and forth condition on interpretations for those second‐order languages without functional variables whose non‐logical vocabulary is finite and excludes functional constants is presented. It is shown that this condition is necessary and sufficient for the interpretations to be equivalent in the language. When applied to second‐order languages with an infinite non‐logical vocabulary, excluding functional constants, the back and forth condition is sufficient but not necessary. It is shown that there is a class of infinitary second‐order languages whose non‐logical vocabulary is infinite for which the back and forth condition is both necessary and sufficient. It is also shown that some applications of the back and forth construction for second‐order languages can be extended to the infinitary second‐order languages. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)