Lexicographic Products of Half Linearly Ordered Groups

The notion of the half linearly ordered group (and, more generally, of the half lattice ordered group) was introduced by Giraudet and Lucas [2]. In the present paper we define the lexicographic product of half linearly ordered groups. This definition includes as a particular case the lexicographic product of linearly ordered groups. We investigate the problem of the existence of isomorphic refinements of two lexicographic product decompositions of a half linearly ordered group. The analogous problem for linearly ordered groups was dealt with by Maltsev [5]; his result was generalized by Fuchs [1] and the author [3]. The isomorphic refinements of small direct product decompositions of half lattice ordered groups were studied in [4].     

Lexicographic product decompositions of half linearly ordered loops

In this paper we prove for an hl-loop Q an assertion analogous to the result of Jakubík concerning lexicographic products of half linearly ordered groups. We found conditions under which any two lexicographic product decompositions of an hl-loop Q with a finite number of lexicographic factors have isomorphic refinements.     

On monotone permutations of`ℓ-cyclically ordered sets

For an ℓ-cyclically ordered set M with the ℓ-cyclic order C let P(M) be the set of all monotone permutations on M. We define a ternary relation on the set P(M). Further, we define in a natural way a group operation (denoted by ·) on P(M). We prove that if the ℓ-cyclic order C is complete and ≠ 0, then (P(M),·, ) is a half cyclically ordered group.     

Distinguished Completion of a Direct Product of Lattice Ordered Groups

The distinguished completion E(G) of a lattice ordered group G was investigated by Ball [1], [2], [3]. An analogous notion for MV-algebras was dealt with by the author [7]. In the present paper we prove that if a lattice ordered group G is a direct product of lattice ordered groups G _i (i I), then E(G) is a direct product of the lattice ordered groups E(G _i). From this we obtain a generalization of a result of Ball [3].     

利用二阶上三角矩阵构造各类非交换的序群

利用二阶上三角矩阵分别构造了非交换的序群、拟序群、拟偏序群和拟格序群.     

On a Generalization of the Notion of Orthogonality and on the Riesz Groups

A method for generalizing the notion of orthogonality to arbitrary partially ordered groups is considered. In the paper, the properties of almost orthogonal elements in Riesz groups are investigated. A series of results on convex directed subgroups associated with a pair of almost orthogonal elements of a Riesz group is obtained. For these subgroups, some theorems on homomorphisms are proved.     

Extensions of lattice-ordered groups

A number of conditions are specified which are sufficient for totally ordered groups with polycyclic factor group to contain a finite normal series of convex subgroups whose factors possess good enough properties. In any case studying such totally ordered groups is reduced to treating extensions of these groups as well as their virtually o-equivalent extensions. The concept of a virtually o-equivalent extension is a particular case of the notion of an Archimedean extension. Supported by RFBR project No. 03-01-00320. Translated from Algebra i Logika, Vol. 47, No. 5, pp. 529–540, September–October, 2008.     

Changes of Parameters for Generalized Power Series

A new notion of differentials is introduced to the method of generating functions for generalized power series with exponents in a totally ordered Abelian group. A logarithmic analogue of cohomology residues is defined to serve as a tool in the technique of equating coefficients.     

Strong Projectability of Lattice Ordered Groups

In this paper we prove that the lateral completion of a projectable lattice ordered group is strongly projectable. Further, we deal with some properties of Specker lattice ordered groups which are related to lateral completeness and strong projectability. This work was supported by VEGA grant 2/1131/21.     

On a cancellation rule for subdirect products of lattice ordered groups and of <Emphasis Type="Italic">GMV</Emphasis>-algebras

The notion of internal subdirect decomposition can be defined in each variety of algebras. In the present note we prove the validity of a cancellation rule concerning such decompositions for lattice ordered groups and for GMV-algebras. For the case of groups, this cancellation rule fails to be valid. This work was partially supported by the Slovak Academy of Sciences via the project Center of Excellence — Physics of Information, Grant I/2/2005.     

Soft ordered semigroups

Molodtsov introduced 1999 the concept of soft set as a new mathematical tool for dealing with uncertainties that is free from the difficulties that have troubled the usual theoretical approaches. In this paper we apply the notion of soft sets by Molodtsov to ordered semigroups. The notions of (trivial, whole) soft ordered semigroup, soft ordered subsemigroup, soft left (right) ideal, and left (right) idealistic soft ordered semigroup are introduced, and various related properties are investigated (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

关于序半群的模糊拟理想

In this paper,fuzzy quasi-ideals of ordered semigroups are characterized by the properties of their level subsets.Furthermore,we introduce the notion of completely semiprime fuzzy quasi-ideals of ordered semigroups and characterize strongly regular ordered semigroups in terms of completely semiprime fuzzy quasi-ideals.Finally,we investigate the characterizations and decompositions of left and right simple ordered semigroups by means of fuzzy quasi-ideals.     

On Pseudocomplemented and Stone Ordered Sets

The aim of this paper is to characterize both the pseudocomplemented and Stone ordered sets in a manner similar to that used previously for Boolean and distributive ordered sets. The sublattice G(A) of the Dedekind–Mac Neille completion DM(A) of an ordered set A generated by A is said to be the characteristic lattice of A. We will show that there are distributive pseudocomplemented ordered sets whose characteristic lattices are not pseudocomplemented. We can define a stronger notion of pseudocomplementedness by demanding that both A and G(A) be pseudocomplemented. It turns out that the two concepts are the same for finite and Stone ordered sets.     

A common generalization for MV-algebras and Łukasiewicz–Moisil algebras

We introduce the notion of n-nuanced MV-algebra by performing a Łukasiewicz–Moisil nuancing construction on top of MV-algebras. These structures extend both MV-algebras and Łukasiewicz–Moisil algebras, thus unifying two important types of structures in the algebra of logic. On a logical level, n-nuanced MV-algebras amalgamate two distinct approaches to many valuedness: that of the infinitely valued Łukasiewicz logic, more related in spirit to the fuzzy approach, and that of Moisil n-nuanced logic, which is more concerned with nuances of truth rather than truth degree. We study n-nuanced MV-algebras mainly from the algebraic and categorical points of view, and also consider some basic model-theoretic aspects. The relationship with a suitable notion of n-nuanced ordered group via an extension of the Γ construction is also analyzed.     

On Pseudocomplemented and Stone Ordered Sets,Addendum

The notion of pseudocomplementedness is weakened in order to obtain a tractable and consistent property of ordered sets, in particular lattices.     

Affine completeness and wreath product decompositions of lattice ordered group

Let Δ and H be a nonzero abelian linearly ordered group or a nonzero abelian lattice ordered group, respectively. In this paper we prove that the wreath product of Δ and H fails to be affine complete. Supported by VEGA grant 2/4134/24. This work has been partially supported by the Slovak Academy of Sciences via the project Center of Excellence-Physics of Information, grant I/2/2005.     

Sequential convergences on cyclically ordered groups without Urysohn’s axiom

In this paper we investigate sequential convergences on a cyclically ordered group G which are compatible with the group operation and with the relation of cyclic order; we do not assume the validity of the Urysohn’s axiom. The system convG of convergences under consideration is partially ordered by means of the set-theoretical inclusion. We prove that convG is a Brouwerian lattice. This work has been partially supported by the Slovak Academy of Sciences via the project Center of Excellence-Physics of Information, grant I/2/2005.     

Ohkuma Structures

The construction and characterization by T. Ohkuma of a chain whose automorphism group acts uniquely transitively is extended in this article to analogues for circularly ordered sets and betweenness chains.     

Extensions of partially ordered partial abelian monoids

The notion of a partially ordered partial abelian monoid is introduced and extensions of partially ordered abelian monoids by partially ordered abelian groups are studied. Conditions for the extensions to exist are found. The cases when both the above mentioned structures have the Riesz decomposition property, or are lattice ordered, are treated. Some applications to effect algebras and MV-algebras are shown.     

Completion of Linearly Ordered Groups

We give examples of linearly ordered groups that are not embeddable in divisible orderable. In the first example, the group does not embed in any divisible group with strictly isolated unity. In the second example, the group in question is an O*-group, and in the third, it is a group with a central system of convex subgroups. To my teacher A. I. Kokorin Supported by RFBR grant Nos. 96-01-00358, 99-01-00335, and 03-01-00320. __________ Translated from Algebra i Logika, Vol. 44, No. 6, pp. 664–681, November–December, 2005.