阿基米德序半群的链的若干刻画

本文首先引入了一个序半群$S$的准素模糊理想的概念,通过序半群$S$上的一些二元关系以及它的理想的模糊根给出了该序半群是阿基米德序子半群的半格的一些刻画.进一步地借助于序半群$S$的模糊子集对该序半群是阿基米德序子半群的半格进行了刻画.尤其是通过序半群的模糊素根定理证明了序半群$S$是阿基米德序子半群的链当且仅当$S$是阿基米德序子半群的半格且$S$的所有弱完全素模糊理想关于模糊集的包含关系构成链.     

Rogers Semilattices of Finite Partially Ordered Sets

It is proved that the principal sublattice of a Rogers semilattice of a finite partially ordered set is definable. For this goal to be met, we present a generalization of the Denisov theorem concerning extensions of embeddings of Lachlan semilattices to ideals of Rogers semilattices.     

Boolean and distributive ordered sets: Characterization and representation by sets

Boolean ordered sets generalize Boolean lattices, and distributive ordered sets generalize distributive lattices. Ideals, prime ideals, and maximal ideals in ordered sets are defined, and some well-known theorems on Boolean lattices, such as the Glivenko-Stone theorem and the Stone representation theorem, are generalized to Boolean ordered sets. A prime ideal theorem for distributive ordered sets is formulated, and the Birkhoff representation theorem is generalized to distributive ordered sets. Fundamental are the embedding theorems for Boolean ordered sets and for distributive ordered sets.Financial support of the Grant Agency of the Czech Republic under the grant No. 201/93/0950 is gratefully acknowledged.     

An order topologyfor finitely generated free monoids

In this article a method is given for embedding a finitely generated free monoid as a dense subset of the unit interval. This gives an order topology for the monoid such that the submonoids generated by an important class of maximal codes occur as “thick” subsets. As an ordered topological space, the notion of thickness in a frec monoid can be interpreted in a number of ways. One such notion is that of density. In particular, subsets of a free monoid that fail to meet all two sided ideals (the thin sets, of which recognizable codes are an example) are shown (corollary 4.2) to be nowhere dense. Furthermore, it is shown (corollary 5.1) that a thin code is maximal if and only if the submonoid that it generates is dense on some interval. Thus thin codes that are maximal are precisely those that generate thick submonoids. Another notion of thickness is that of category. The embedding allows the free monoid to be viewed as a subspace of the unit interval. In theorem 5.6 it is shown that a thin code is maximal just in case the closure of the submonoid that it generates is second category in the unit interval. A mild connection with Lebesque measure is then made. In what follows, all free monoids are assumed to be generated by a finite set of at least two elements. IfA is such a set, thenA ^* denotes the free monoid generated byA. The setA is called an alphabet, the elements ofA ^* are called words, ande denotes the empty word inA ^*. Topological terminology and notation follows that of Kelley [2].     

On Minimal and Maximal Left Ideals in Ordered Semigroups*

The concept of maximal left ideals is introduced in ordered semigroups. Characterizatations of minimal left and maximal left ideals are given.     

On the structure of cross connections and Galois connections

Journal of Applied Mathematics and Computing - We consider partially ordered set as passing from the set of ideals to the set of filters in Cartesian product of partially ordered sets. Lawson...     

Initial Segments in Rogers Semilattices of \Sigma _n^0 -Computable Numberings

S. Goncharov and S. Badaev showed that for , there exist infinite families whose Rogers semilattices contain ideals without minimal elements. In this connection, the question was posed as to whether there are examples of families that lack this property. We answer this question in the negative. It is proved that independently of a family chosen, the class of semilattices that are principal ideals of the Rogers semilattice of that family is rather wide: it includes both a factor lattice of the lattice of recursively enumerable sets modulo finite sets and a family of initial segments in the semilattice of -degrees generated by immune sets.     

CS-indecomposable ordered semigroups

An ordered semigroup S is called CS-indecomposable if the set S × S is the only complete semilattice congruence on S. In the present paper we prove that each ordered semigroup is, uniquely, a complete semilattice of CS-indecomposable semigroups, which means that it can be decomposed into CS-indecomposable components in a unique way. Furthermore, the CS-indecomposable ordered semigroups are exactly the ordered semigroups that do not contain proper filters. Bibliography: 6 titles. Published in Zapiski Nauchnykh Seminarov POMI, Vol. 343, 2007, pp. 222–232.     

SUBGROUPS OF THE FREE SEMIGROUP ON A BIORDERED SET IN WHICH PRINCIPAL IDEALS ARE SINGLETONS

ABSTRACT

Easdown has conjectured that the subgroups of the free semigroup on an arbitrary biordered set are free. In this note a weaker conjecture is verified. It is shown that the subgroups of the free semigroup on a biordered set in which principal ideals are singletons are free. In addition, an expression is given for the ranks of the maximal subgroups. This generalizes a result due to Pastijn which involves the free semigroup on a rectangular biset.     

On Chains in <Emphasis Type="BoldItalic">H</Emphasis>-Closed Topological Pospaces

We study chains in an H-closed topological partially ordered space. We give sufficient conditions for a maximal chain L in an H-closed topological partially ordered space (H-closed topological semilattice) under which L contains a maximal (minimal) element. We also give sufficient conditions for a linearly ordered topological partially ordered space to be H-closed. We prove that a linearly ordered H-closed topological semilattice is an H-closed topological pospace and show that in general, this is not true. We construct an example of an H-closed topological pospace with a non-H-closed maximal chain and give sufficient conditions under which a maximal chain of an H-closed topological pospace is an H-closed topological pospace.     

On Ordered Semigroups Which are Semilattices of Simple and Regular Semigroups

We characterize the ordered semigroups which are decomposable into simple and regular components. We prove that each ordered semigroup which is both regular and intra-regular is decomposable into simple and regular semigroups, and the converse statement also holds. We also prove that an ordered semigroup S is both regular and intra-regular if and only if every bi-ideal of S is an intra-regular (resp. semisimple) subsemigroup of S. An ordered semigroup S is both regular and intra-regular if and only if the left (resp. right) ideals of S are right (resp. left) quasi-regular subsemigroups of S. We characterize the chains of simple and regular semigroups, and we prove that S is a complete semilattice of simple and regular semigroups if and only if S is a semilattice of simple and regular semigroups. While a semigroup which is both π-regular and intra-regular is a semilattice of simple and regular semigroups, this does not hold in ordered semigroups, in general.     

序半环的序理想

An ordered semiring is a semiring S equipped with a partial order ≤ such that the operations are monotonic and constant 0 is the least element of S.In this paper,several notions,for example,ordered ideal,minimal ideal,and maximal ideal of an ordered semiring,simple ordered semirings,etc.,are introduced.Some properties of them are given and characterizations for minimal ideals are established.Also,the matrix semiring over an ordered semiring is consid-ered.Partial results obtained in this paper are analogous to the corresponding ones on ordered semigroups,and on the matrix semiring over a semiring.     

多项式组的特征分解

任一多项式理想的特征对是指由该理想的约化字典序Grobner基G和含于其中的极小三角列C构成的有序对(G,C).当C为正则列或正规列时,分别称特征对(G,C)为正则的或正规的.当G生成的理想与C的饱和理想相同时,称特征对(G,C)为强的.一组多项式的(强)正则或(强)正规特征分解是指将该多项式组分解为有限多个(强)正则或(强)正规特征对,使其满足特定的零点与理想关系.本文简要回顾各种三角分解及相应零点与理想分解的理论和方法,然后重点介绍(强)正则与(强)正规特征对和特征分解的性质,说明三角列、Ritt特征列和字典序Grobner基之间的内在关联,建立特征对的正则化定理以及正则、正规特征对的强化方法,进而给出两种基于字典序Grobner基计算、按伪整除关系分裂和构建、商除可除理想等策略的(强)正规与(强)正则特征分解算法.这两种算法计算所得的强正规与强正则特征对和特征分解都具有良好的性质,且能为输入多元多项式组的零点提供两种不同的表示.本文还给出示例和部分实验结果,用以说明特征分解方法及其实用性和有效性.     

On the free implicative semilattice extension of a Hilbert algebra

Hilbert algebras provide the equivalent algebraic semantics in the sense of Blok and Pigozzi to the implication fragment of intuitionistic logic. They are closely related to implicative semilattices. Porta proved that every Hilbert algebra has a free implicative semilattice extension. In this paper we introduce the notion of an optimal deductive filter of a Hilbert algebra and use it to provide a different proof of the existence of the free implicative semilattice extension of a Hilbert algebra as well as a simplified characterization of it. The optimal deductive filters turn out to be the traces in the Hilbert algebra of the prime filters of the distributive lattice free extension of the free implicative semilattice extension of the Hilbert algebra. To define the concept of optimal deductive filter we need to introduce the concept of a strong Frink ideal for Hilbert algebras which generalizes the concept of a Frink ideal for posets.     

A generalization of the rees theorem to a class of regular semigroups

Let S be a regular semigroup for which Green's relations J and D coincide, and which is max-principal in the sense that every element of S is contained in maximal principal right, left and two-sided ideals of S. A construction is given of a max-principal regular semigroup W with J=D, which is also principally separated in the sense that distinct maximal principal right (or left) ideals of S are disjoint, and an epimorphism ψ: W→S that preserves maximality of principal left, right, and two sided ideals, and is in a sense locally one-to-one. If S is completely simple, this construction reduces to the Rees matrix representation of S. The main result of this paper has its origin in an incorrect result contained in the author's doctoral dissertation which was written at the University of California (Berkeley) under Professor John Rhodes. This theorem was first established for finite regular semigroups in [1] (Corollary 2.3), and the present generalization of this result to infinite semigroups was suggested by Professor A. H. Clifford, who the author would like to thank for this as well as his generous encouragement and many helpful editorial suggestions. The author would also like to thank Professor Rhodes for his encouragement.     

偏序半群的最大自然序半格同态象

引进了自然序半格，偏序半群的自然序半格同态象和二次主根基等概念，利用二次主根基构造出了任意偏序半群的最大自然序半格同态象。     

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

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

序半群的阿基米德半群的半格分解

本文通过一个序半群S上的一些二元关系以及它的理想的根集的性质该序半群是阿基米德半群的半格,特别地是阿基米德半群的链的刻划,证明了S是阿基米德链当且仅当S是准素的.通过序半群的m-系的概念,证明了S的任意半素理想是含它的所有素理想的交,并通过该结论,证明了S是阿基米德半群的链当且仅当S是阿基米德半群的半格且S的所有素理想关于集包含关系构成链.作为应用,该结论在一般的半群（没有序）[1]中也成立.     

Going down in (semi)lattices of finite moore families and convex geometries

In this paper we first study what changes occur in the posets of irreducible elements when one goes from an arbitrary Moore family (respectively, a convex geometry) to one of its lower covers in the lattice of all Moore families (respectively, in the semilattice of all convex geometries) defined on a finite set. Then we study the set of all convex geometries which have the same poset of join-irreducible elements. We show that this set—ordered by set inclusion—is a ranked join-semilattice and we characterize its cover relation. We prove that the lattice of all ideals of a given poset P is the only convex geometry having a poset of join-irreducible elements isomorphic to P if and only if the width of P is less than 3. Finally, we give an algorithm for computing all convex geometries having the same poset of join-irreducible elements.