The universal Lachlan semilattice without the greatest element

We deal with some upper semilattices of m-degrees and of numberings of finite families. It is proved that the semilattice of all c.e. m-degrees, from which the greatest element is removed, is isomorphic to the semilattice of simple m-degrees, the semilattice of hypersimple m-degrees, and the semilattice of Σ ₂ ⁰ -computable numberings of a finite family of Σ ₂ ⁰ -sets, which contains more than one element and does not contain elements that are comparable w.r.t. inclusion. Supported by the Grant Council (under RF President) for Young Russian Scientists via project MK-1820.2005.1. __________ Translated from Algebra i Logika, Vol. 46, No. 3, pp. 299–345, May–June, 2007.     

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.     

On linearly ordered <Emphasis Type="Italic">H</Emphasis>-closed topological semilattices

We give a criterion for a linearly ordered topological semilattice to be H-closed. We also prove that any linearly ordered H-closed topological semilattice is absolutely H-closed and we show that every linearly ordered semilattice is a dense subsemilattice of an H-closed topological semilattice.     

Non-Complementedness and Non-Distributivity of Kleene Degrees

In this note, we study the complementedness and the distributivity of upper semilattices of Kleene degrees assuming V = L. K denotes the upper semilattice of all Kleene degrees. We prove that if V = L, then some sub upper semilattices of K are non-complemented and some are non-distributive.     

Semilattice orders on the homomorphic images of the Rédei semigroup

The combinatorial simple principal ideal semigroups generated by two elements were described by L. Megyesi and G. Pollák. The ‘most general’ among them is called the Rédei semigroup. The ‘most special’ combinatorial simple principal ideal semigroup generated by two elements is the bicyclic semigroup. D. B. McAlister determined the compatible semilattice orders on the bicyclic semigroup. Our aim is to study the compatible semilattice orders on the homomorphic images of the Rédei semigroup. We prove that there are four compatible total orders on these semigroups. We show that on the Rédei semigroup, the total orders are the only compatible semilattice orders. Moreover, on each proper homomorphic image of the Rédei semigroup, we give a compatible semilattice order which is not a total order. Communicated by Mária B. Szendrei     

关于两类特殊的代数

本文对泛代数中两类代作了一些研究，得到一些结果，并且讨论了这两类代数在半群中的应用。     

Numbered distributive semilattices

In this article, we consider several definitions of a Lachlan semilattice; i.e., a semilattice isomorphic to a principal ideal of the semilattice of computably enumerable m-degrees. We also answer a series of questions on constructive posets and prove that each distributive semilattice with top and bottom is a Lachlan semilattice if it admits a Σ ₃ ⁰ -representation as an algebra but need not be a Lachlan semilattice if it admits a Σ ₃ ⁰ -representation as a poset. The examples are constructed of distributive lattices that are constructivizable as posets but not constructivizable as join (meet) semilattices. We also prove that every locally lattice poset (in particular, every lattice and every distributive semilattice) possessing a Δ ₂ ⁰ -representation is positive.     

序半群中的最小完全半素序理想

在序半群上定义了几种新的关系,利用它们得到了序半群上最小完全半素理想的结构,并以此给出了序半群的最小正则半格同余的另一种描述,所得结果是Miroslav Ciric在文[1]中的部分结果向序半群上的推广。     

The Categories of m-semilatices

§１．ｍ┐ｓｅｍｉｌａｔｉｃｅｓＧｉｖｅｎａｃａｒｄｉｎａｌｍ．ＡｐｏｓｅｔＰｉｓｃａｌｅｄａｎｍ－ｓｅｍｉｌａｔｉｃｅ，ｉｆｆｏｒａｎｙｎｏｎ－ｅｍｐｔｙｓｕｂｓｅｔＢｏｆＰｗｉｔｈ｜Ｂ｜＜ｍ，ｔｈｅｉｎｆｉｍｕｍ∧ＢｅｘｉｓｔｓｉｎＰ．Ａｓｅｔｗ...     

AN INVARIANT FOR HYPERGRAPHS

ＡＮＩＮＶＡＲＩＡＮＴＦＯＲＨＹＰＥＲＧＲＡＰＨＳＷＡＮＧＪＩＡＮＦＡＮＧ（ＩｎｓｔｉｔｕｔｅｏｆＡＰＰｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，ＣｈｉｎｅｓｅＡｃａｄｅｍｙｏｆＳｃｉｅｎｃｅｓ，Ｂｅｉｊｉｎｇ１０００８０，ＣｈｉｎａａｎｄＡｓｉａ－Ｐａｃｉｆ...     

一类后缀码的代数性质

利用自由含幺半群X*上的一个偏序关系,介绍了一类特殊的后缀码.通过定义这类后缀码上的两种二元运算,研究了这类后缀码的代数性质.证明了该子类在这两种运算下形成一个加法导出是半格的半环,并且满足吸收律.从而提供了一个满足吸收律的半格序半群的例子.     

Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy

We investigate differences in isomorphism types for Rogers semilattices of computable numberings of families of sets lying in different levels of the arithmetical hierarchy. Supported by RFBR grant No. 05-01-00819 and by INTAS grant No. 00-499. Supported by NSFC grant No. 60310213. __________ Translated from Algebra i Logika, Vol. 45, No. 6, pp. 637–654, November–December, 2006.     

Join-semilattices whose sections are residuated PO-monoids

We generalize the concept of an integral residuated lattice to join-semilattices with an upper bound where every principal order-filter (section) is a residuated semilattice; such a structure is called a sectionally residuated semilattice. Natural examples come from propositional logic. For instance, implication algebras (also known as Tarski algebras), which are the algebraic models of the implication fragment of the classical logic, are sectionally residuated semilattices such that every section is even a Boolean algebra. A similar situation rises in case of the Lukasiewicz multiple-valued logic where sections are bounded commutative BCK-algebras, hence MV-algebras. Likewise, every integral residuated (semi)lattice is sectionally residuated in a natural way. We show that sectionally residuated semilattices can be axiomatized as algebras (A, r, →, ⇝, 1) of type 〈3, 2, 2, 0〉 where (A, →, ⇝, 1) is a {→, ⇝, 1}-subreduct of an integral residuated lattice. We prove that every sectionally residuated lattice can be isomorphically embedded into a residuated lattice in which the ternary operation r is given by r(x, y, z) = (x · y) ∨ z. Finally, we describe mutual connections between involutive sectionally residuated semilattices and certain biresiduation algebras. This work was supported by the Czech Government via the project MSM6198959214.     

Ideals of Priestley powers of semilattices

Let X be a poset and Y an ordered space; X ^Y denotes the poset of continuous order-preserving maps from Y to X with the discrete (respectively, Scott, Lawson) topology. If S is a -semilattice, its ideal semilattice, and T a bounded distributive lattice with Priestley dual space P(T), it is shown that the following isomorphisms hold: Moreover, and sufficient conditions and necessary conditions for the isomorphism to hold are obtained (both necessary and sufficient if S is a distributive -semilattice). Received September 27, 1995; accepted in final form April 6, 1998.     

Necessary Isomorphism Conditions for Rogers Semilattices of Finite Partially Ordered Sets

We establish a condition that is necessary for Rogers semilattices of computable numberings of finite families of computably enumerable sets to be isomorphic.     

交换半群的强半格

本文刻划交换半群的强半格上的最小半格同余，并证明由此得到的商半群为对应的每个交换半群的商半群的强半格。     

一类逆半群的亚直可约性

本文利用逆半群上的同余扩张，讨论了一类逆半群的亚直可约性，并刻划了这类逆半群的幂等元集的特征。     

Rank properties of certain semigroups

In this paper we consider certain ranks of some semigroups. These ranks are r ₁(S),r ₂(S),r ₃(S),r ₄(S) and r ₅(S) as defined below. We have r ₁≤r ₂≤r ₃≤r ₄≤r ₅. The semigroups are CL _n ,CL _m ×CL _n ,Z _n and SL _n . Here CL _n is a chain with n elements, Z _n is the zero semigroup on n elements and SL _n is the free semilattice generated by n elements and having 2 ⁿ −1 elements. We find many of the ranks for these classes of semigroups.     

幺半群的强半格上的Rees矩阵半群的平移壳

设含幺元的半群A是幺半群A~_e的半格,其中A的幺元为1_A,A~_e的幺元为e,所有幺元e的集合为E(A),则对于幺半群A上的Rees矩阵半群S和幺半群A~_e上的Rees矩阵半群S~_e,以下五个条件是等价的:(1)任意的e∈E(A),a∈A,有ae=ea;(2)A是幺半群A~_e的强半格;(3)S是S~_e的强半格;(4)A的平移壳和A~_e的平移壳的强半格同构;(5)S的平移壳和S~_e的平移壳的强半格同构.