FI代数的新型软MP理想

将软集概念及其相关运算运用到FI代数问题的研究。首先,提出了FI代数新型软MP理想的概念;其次利用软集的交(限制交)、且等运算,研究了FI代数的软MP理想的基本性质,并运用对偶软集的方法给出了FI代数软MP理想的等价刻画;最后讨论了FI代数的软MP理想的同态像和原像的性质。     

Fuzzy蕴涵代数的MP滤子

给出了Fuzzy蕴涵代数(简称FI代数)上的MP滤子的等价刻画和由非空子集生成的MP滤子的表示定理; 探讨了FI代数的MP滤子与偏序滤子之间的关系; 证明了一个FI代数上全体MP滤子之集在集合包含序下构成一个分配连续(代数)格,从而构成一个Frame.     

Fuzzy蕴涵代数的素MP滤子

对Fuzzy蕴涵代数(简称FI代数)的滤子理论作深入研究.首先对由非空集合生成的MP滤子的性质作进一步探讨;然后引入素MP滤子的概念并讨论其基本性质,给出了素MP滤子的若干等价刻画,证明了并半格FI代数的素MP滤子定理;最后利用素MP滤子概念时满足条件(S)的并半格FI代数的MP滤子格((L)MP(X),(∩))中的素元进行刻画.     

Fuzzy蕴涵代数的素模糊MP滤子

本文的目的是对Fuzzy蕴涵代数(简称FI代数)中的模糊MP滤子理论作进踊步深入研究。首先,引入素模糊MP滤子的概念并研究其性质,建立并证明了并半格FI代数的素模糊MP滤子定理;其次,在FI代数的素模糊MP滤子全体之集PFFMP(X)上构造了一个拓扑T,证明了拓扑空间(PFFMP(X),T)是T0空间。     

Quantale代数及其代数理想

给出Quantale代数的概念,得到了单位Quantale是Quantale代数的充要条件,讨论了理想与代数理想的关系,找到了理想不是代数理想的具体例子以及理想是代数理想的充分条件.     

FI代数上的MP滤子拓扑空间

首先,在FI代数X上以全体MP滤子之集为基建立了一个拓扑空间(X,F_(MP)).给出了拓扑空间(X,F_(MP))中集合A的导集、闭包和内部的计算公式.其次,考察了(X,X_(MP))的若干拓扑性质.最后,研究了乘积FI代数的乘积MP滤子拓扑.     

BCK—代数的可换理想

本文是作者[1],[2]和[3]的继续,引入了可换理想的概念,并讨论它的重要性质,特别是用可换理想刻划了可换BCK-代数,从而建立了BCK-代数的一套较完备的理想理论。 1976年K.Ise’ki和S.Tanaka引入了正定关联理想概念,借此刻划了正定关联BCK-代数;1984年,我们引入关联理想概念,借此刻划了关联BCK-代数。如所周知,正定关联BCK-代数、关联BCK-代数和可换BCK-代数是BCK-代数的三个重要类型。既然前两类代数都已用理想所刻划,那么可换BCK-代数能否用理想刻划?这里首先遇到的困难是如何定义可换理想,并使它带有更多的信息。     

BCK-代数的模糊代数理想

在有界可换BCK-代数上引入了Fuzzy代数理想的概念，给出了Fuzzy代数理想的某些特征，讨论了Fuzzy理想与Fuzzy代数理想的关系。最后描述了全体Fuzzy集的BCK-代数特征。     

有界Heyting代数的交换理想与关联理想

运用泛代数和格理论的方法和原理进一步深入研究有界Heyting代数的理想问题。在有界Heyting代数中引入了交换理想、关联理想和正关联理想概念并讨论了它们的性质和相互关系。获得了各种理想的若干等价刻画。证明了在有界Heyting代数中,关联理想和正关联理想等价;在Ockham型有界Heyting代数中,理想和交换理想等价。同时,给出了有界Heyting代数的交换理想成为关联理想的一个充分必要条件。     

BCK—代数理想（Ⅳ）

本文是作者［１］－［６］的继续，我们得到下述结果：定理４．设Ｉ是ＢＣＫ－代数Ｘ的一个理想，ａ是Ｘ的一个元素，则包含Ｉ和ａ的最小理想是对某个非负整数｝．定理１４．设Ｘ是一个Ｌｕｋａｓｉｅｗｉｃｚ代数，Ｉ是Ｘ的一个质理想．如果Ａ是Ｘ的一个真理想且，则Ａ也是质的．定理１５．Ｌｕｋａｓｉｅｗｉｃｚ代数Ｘ的零理想｛０｝是质的当且仅当＜Ｘ；≤＞是一个全序集．     

Polygons with primitive normal and additive theories

Previously, primitive normal, primitive connected, and additive theories of S-polygons were studied. In particular, it was proved that the class of all S-polygons is primitive normal iff S is a linearly ordered monoid. The present paper is a continuation of this research. Here, Spolygons with primitive normal, additive, and antiadditive theories are described in the language of a primitive equivalence structure. It is shown that the class of all S-polygons is antiadditive only for a linearly ordered monoid S, that is, this class is antiadditive iff it is primitive normal.     

Primitive connected and additive theories of polygons

We study into monoids S the class of all S-polygons over which is primitive normal, primitive connected, or additive, that is, the monoids S the theory of any S-polygon over which is primitive normal, primitive connected, or additive. It is proved that the class of all S-polygons is primitive normal iff S is a linearly ordered monoid, and that it is primitive connected iff S is a group. It is pointed out that there exists no monoid S with an additive class of all S-polygons. __________ Translated from Algebra i Logika, Vol. 45, No. 3, pp. 300–313, May–June, 2006.     

交一致连续偏序集

In this paper, as a generalization of uniform continuous posets, the concept of meet uniform continuous posets via uniform Scott sets is introduced. Properties and characterizations of meet uniform continuous posets are presented. The main results are:(1) A uniform complete poset L is meet uniform continuous iff ↑(U ∩↓ x) is a uniform Scott set for each x ∈ L and each uniform Scott set U;(2) A uniform complete poset L is meet uniform continuous iff for each∨∨x∈ L and each uniform subset S, one has x ∧S ={x ∧ s | s ∈ S}. In particular, a complete lattice L is meet uniform continuous iff L is a complete Heyting algebra;(3) A uniform complete poset is meet uniform continuous iff every principal ideal is meet uniform continuous iff all closed intervals are meet uniform continuous iff all principal filters are meet uniform continuous;(4) A uniform complete poset L is meet uniform continuous if L1 obtained by adjoining a top element1 to L is a complete Heyting algebra;(5) Finite products and images of uniform continuous projections of meet uniform continuous posets are still meet uniform continuous.     

A characterization of totally normal structure

In this note it is proved that a subsetA of a locally convex topological vector spaceE has normal structure with respect to every continuous seminorm onE — called totally normal structure — iff every bounded convex subset ofA is precompact. Some consequences are discussed.     

Remarks on normal operators on Banach spaces

Rendiconti del Circolo Matematico di Palermo Series 2 - A closed densely defined operatorT on a Banach spaceX is called normal, iff $$T \in [C^0 (\hat \not C)]$$ , i.e. there is a homomorphism...     

A CHARACTERIZATI0N OF SUBMETACOMPACTNESS

The following results are obtained: 1.A space is submetacompact iff it is almost discretely $\[\theta \]$-expandable and strictly qnasi-paracompact. 2.A space is paracompact iff it is $\[\theta \]$-expandable and strictly quasi-paracompact.     

WHEN ARE DIVISIBLE ABELIAN GROUPS INJECTIVE?

Abstract

The above question is considered, in the categories ShL of sheaves on a local lattice L and MEns of sets acted upon by a monoid M, for either all divisible abelian groups or all torsionfree divisible abelian groups, the aim being to characterize those L and M for which these types of abelian groups are Injective. Typical results: All divisible abelian groups are injective (i) in ShL iff L is Boolean, (ii) in MEns, M left or right cancellative, iff M is trivial, and (iii) in MEns, M commutative iff M is finite and idempotent.     

条件交半格中的相对极大滤子

引入偏序集的相对极大滤子的概念,证明在任意条件交半格中一个滤子是相对极大滤子当且仅当它是滤子格的完全交不可约元.一个格是分配的当且仅当每一个相对极大滤子都是素滤子.随后研究了Heyting代数中相对极大滤子的刻画,最后定义和研究了完全并既约生成格.     

RP—环

本文定义了ＲＰ－环,讨论了它的性质和等价条件,得出了Ｓ＝Ｍｎ（Ｒ）是ＲＰ－环妥且仅当Ｒ是ＲＰ－环;Ｒｉ是ＲＰ－环当且仅当每个Ｒｉ是ＲＰ－环．最后讨论了ＲＰ－环的同态象和左投射维数．     

On the Shadowing Property and Shadowable Point of Set-valued Dynamical Systems

In this article, the authors introduce the concept of shadowable points for set-valued dynamical systems, the pointwise version of the shadowing property, and prove that a set-valued dynamical system has the shadowing property iff every point in the phase space is shadowable; every chain transitive set-valued dynamical system has either the shadowing property or no shadowable points; and for a set-valued dynamical system there exists a shadowable point iff there exists a minimal shadowable point. In the end, it is proved that a set-valued dynamical system with the shadowing property is totally transitive iff it is mixing and iff it has the specification property.