首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 135 毫秒
1.
拓扑分子格范畴中的积运算   总被引:4,自引:0,他引:4  
文[1,2]以近年来发展起来的Fuzzy拓扑学中的工作为基础,建立了完全分配格上的点式拓扑理论。在文[1—3]的基础上,文[4]证明了分子格范畴对乘积运算封闭,并给出了其具体构造。本文进一步证明拓扑分子格范畴也对乘积运算封闭,同时给出了拓扑分子格范畴中的乘积结构。本文还证明这种乘积具有良好的性质,比如:连通性是可乘的最后,给出了这种乘积与L-Fuzzy拓扑空间乘积的关系。  相似文献   

2.
根据L-模糊拓扑自身的特点,在L-模糊拓扑空间中引入了内部度的定义,详细讨论了它的性质,提出了L-模糊拓扑上的内部算子的概念,论证了L-TFIN(拓扑的L-模糊内部空间和其上的连续映射构成的范畴)同构于L-FTOP(L-模糊拓扑空间和其上的连续映射构成的范畴).  相似文献   

3.
对完备格 L;记v(L)为 L上的上拓扑之闭集格本文证明了完备格 L为 F-分配格当且仅当映射sup:v(L)→L为满完备格同态;若L为F-分配的Boole格,则L同构于某幂集格、对T1格 L,证明了下述各条件等价。(1) L同构于某幂集格;(2) L上的区间拓扑是 Hausdorff的;(3)是有限分离的;(4) L是连续的对马空间(X,O(X)),进一步证明了 O(X)上的区间拓扑不可能为 Hausdorff的,除非(X, O(X))是离散空间.  相似文献   

4.
完全分配格上的点式拟一致结构   总被引:6,自引:1,他引:5  
史福贵 《数学进展》1997,26(1):22-28
本文在完全分配格上建立了一种点式拟一致结构理论,许多一般拓扑中的相应定理都被得到了。特别地,我们证明了每个拓扑分子格都可以拟一致化。此外,还讨论了乘积拟一致分子格的拓扑结构。  相似文献   

5.
可加的广义代数格范畴与 T0 拓扑空间范畴相等价, 从这个观点出发, 作者把可加广义代数格作为一个闭集格, 在其上建立 Urysohn 引理和 Tietze 扩张定理. 这是拓扑理论在格上的一种新推广, 有助于格上拓扑理论的研究和广义连续格理论的应用.  相似文献   

6.
拓扑分子格范畴的乘积与上积   总被引:1,自引:0,他引:1  
本文在樊太和关于分子格范畴的积运算的基础上,研究了以拓扑分子格(TML)为对象,连续的广义序同态(CGOH)为态射的范畴中的乘积与上积,它们是一般拓扑学、Fuzzy拓扑学中积(和)空间概念的推广。  相似文献   

7.
设[0,1]-VNRS是单值中智关系空间和连续映射构成的范畴,证明了[0,1]-VNRS是拓扑的(resp.余拓扑的)范畴,获得了一些关于商单值中智关系空间和乘积单值中智关系空间的结果。最后,证明了[0,1]-VNRS是笛卡尔闭的范畴。  相似文献   

8.
定义了LX上的M-滤子,研究了LX上的M-滤子的交、并、乘积等运算,证明了(L,M)-fuzzy收敛空间范畴是一个拓扑范畴并给出了始结构与终结构的构造,在此基础上给出了乘积(L,M)-fuzzy收敛空间、余积(L,M)-fuzzy收敛空间以及商(L,M)-fuzzy收敛空间的概念。  相似文献   

9.
本文讨论了L-Fuzzy拓扑空间到L-Fuzzy实直线R(L)的所有L-Fuzzy连续函数的格C(L~x)的代数性质与(L~x,δ)的拓扑性质——紧性的关系;指出了L~x上的L-Fuzzy拓扑可以用格C(L~x)直接刻划。并且构造了L-Fuzzy Stone拓扑;通过代数方法较简单地证明了Tychonoff乘积定理。  相似文献   

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

11.
引入逆序(L)集合范畴概念,并研究该范畴中两种函数空间结构表示,即格值函数空间与伪格值函数空间,进一步指出在逆序(L)集合范畴中格值函数空间函子与格值积函子互为伴随及伪格值函数空间函子与格值交函子也互为伴随,从而逆序(L)集合范畴为Cartesian闭范畴.  相似文献   

12.
鉴于L-fuzzy集在理论上的重要性和应用上的广泛性,旨在建立L-fuzzy集理论的范畴基础与它的层表示,提出完备范畴中对象上的格值结构概念,这一概念是L-fuzzy结构在范畴层面上的提升,进一步提出完备范畴上格值结构提升范畴概念,证明了在集合范畴中L-fuzzy结构与格值结构是同构的.以集层、群层、环层和左R-模层以及Grothendieck层等概念为基础,提出完备范畴中对象上的层结构以及完备范畴上层结构提升范畴概念,证明了在集合范畴中L-fuzzy结构与层结构也是同构的.  相似文献   

13.
A category of lattice-valued fuzzy interior operator spaces is defined and studied. Axioms are given in order for this category to be isomorphic to the category whose objects consist of all the stratified, lattice-valued, pretopological convergence spaces.  相似文献   

14.
In this paper we formulate and prove an order unit Banach space version of a Banach-Stone theorem type theorem for Riesz isomorphisms of the space of vector-valued continuous functions. Similar results were obtained recently for the case of lattice-valued continuous functions in [5] and [6].  相似文献   

15.

The unbounded derived category of a Grothendieck abelian category is the homotopy category of a Quillen model structure on the category of unbounded chain complexes, where the cofibrations are the injections. This folk theorem is apparently due to Joyal, and has been generalized recently by Beke. However, in most cases of interest, such as the category of sheaves on a ringed space or the category of quasi-coherent sheaves on a nice enough scheme, the abelian category in question also has a tensor product. The injective model structure is not well-suited to the tensor product. In this paper, we consider another method for constructing a model structure. We apply it to the category of sheaves on a well-behaved ringed space. The resulting flat model structure is compatible with the tensor product and all homomorphisms of ringed spaces.

  相似文献   


16.
通过应用完全剩余格值逻辑语义的方法把不分明化一致空间和不分明化一致拓扑推广为L-不分明化一致空间和L-不分明化一致拓扑。并且讨论了L-不分明化一致空间和L-不分明化一致拓扑的一些基本性质。  相似文献   

17.
童雪  别荣芳 《数学学报》2007,50(6):1243-124
本文建立了格值逻辑的正规性概念,证明了具有强特征式的有限可补格上的一阶格值逻辑是正规逻辑,并证明了Fraise定理在其上成立.  相似文献   

18.
This is the third part in a series of papers developing a tensor product theory for modules for a vertex operator algebra. The goal of this theory is to construct a “vertex tensor category” structure on the category of modules for a suitable vertex operator algebra. The notion of vertex tensor category is essentially a “complex analogue” of the notion of symmetric tensor category, and in fact a vertex tensor category produces a braided tensor category in a natural way. In this paper, we focus on a particular element P(z) of a certain moduli space of three-punctured Riemann spheres; in general, every element of this moduli space will give rise to a notion of tensor product, and one must consider all these notions in order to construct a vertex tensor category. Here we present the fundamental properties of the P(z)-tensor product of two modules for a vertex operator algebra. We give two constructions of a P(z)-tensor product, using the results, established in Parts I and II of this series, for a certain other element of the moduli space. The definitions and results in Parts I and II are recalled.  相似文献   

19.
本文给出了四类格值自动机及其语言的定义,证明了前三类格值自动机的等价性,讨论了第四类格值自动机与前三类格值自动机的关系。  相似文献   

20.
In this paper we study fuzzy Turing machines with membership degrees in distributive lattices, which we called them lattice-valued fuzzy Turing machines. First we give several formulations of lattice-valued fuzzy Turing machines, including in particular deterministic and non-deterministic lattice-valued fuzzy Turing machines (l-DTMcs and l-NTMs). We then show that l-DTMcs and l-NTMs are not equivalent as the acceptors of fuzzy languages. This contrasts sharply with classical Turing machines. Second, we show that lattice-valued fuzzy Turing machines can recognize n-r.e. sets in the sense of Bedregal and Figueira, the super-computing power of fuzzy Turing machines is established in the lattice-setting. Third, we show that the truth-valued lattice being finite is a necessary and sufficient condition for the existence of a universal lattice-valued fuzzy Turing machine. For an infinite distributive lattice with a compact metric, we also show that a universal fuzzy Turing machine exists in an approximate sense. This means, for any prescribed accuracy, there is a universal machine that can simulate any lattice-valued fuzzy Turing machine on it with the given accuracy. Finally, we introduce the notions of lattice-valued fuzzy polynomial time-bounded computation (lP) and lattice-valued non-deterministic fuzzy polynomial time-bounded computation (lNP), and investigate their connections with P and NP. We claim that lattice-valued fuzzy Turing machines are more efficient than classical Turing machines.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号