Related papers: From partially ordered monoids to partially ordere…

One of the main reasons for the correspondence of regular languages and monadic second-order logic is that the class of regular languages is closed under images of surjective letter-to-letter homomorphisms. This closure property holds for…

The starting point of algebraic language theory is that regular languages of finite words are exactly those recognized by finite monoids. This finiteness condition gives rise to a topological space whose points, called profinite words,…

The study of amalgamation in the category of partially ordered monoids was initiated by Fakhuruddin in the 1980s. In 1986 he proved that, in the category of commutative pomonoids, every absolutely flat commutative pomonoid is a weak…

A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the prefixes of its defining relators. Important results of Guba (1997), and of Ivanov, Margolis and Meakin (2001), show how the word problem for…

We investigate involutive commutative residuated lattices without unit, which are commutative residuated lattice-ordered semigroups enriched with a unary involutive negation operator. The logic of this structure is discussed and the…

We show that nuclear C*-algebras have a refined version of the completely positive approximation property, in which the maps that approximately factorize through finite dimensional algebras are convex combinations of order zero maps. We use…

Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…

Motivated by reconstruction results by Rubin, we introduce a new reconstruction notion for permutation groups, transformation monoids and clones, called automatic action compatibility, which entails automatic homeomorphicity. We further…

In this paper, we give an algebraic completeness theorem for constructive logic with strong negation in terms of finite rough set-based Nelson algebras determined by quasiorders. We show how for a quasiorder $R$, its rough set-based Nelson…

We study atom canonicity for several varieties of cylindric like algebras that contain properly the variety of representable algebras. The algebras in such varieties have relativized representations, and we thereby obtain many omitting…

Constructions are given of Noetherian maximal orders that are finitely presented algebras over a field K, defined by monomial relations. In order to do this, it is shown that the underlying homogeneous information determines the algebraic…

This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…

In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…

While the parameters of atomic nuclei, Z and A, indicate a general structural pattern for the nuclei, their exact masses in their fine differences seem not to exhibit the orderly kind of logical system that systematic and orderly nature…

In this paper, the class of quasicomplemented residuated lattices is introduced and investigated, as a subclass of residuated lattices in which any prime filter not containing any dense element is a minimal prime filter. The notion of…

We show that the coordinate ring of the Vinberg monoid of a simply connected semisimple complex group is an upper cluster algebra. As an application, we construct cluster structures on a large class of flat reductive monoids. After…

Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial…

In this paper, we introduce the notion of Autometrized lattice ordered monoids (for short,AL-monoids) as a generalization to DRl-semi groups. We obtain the basic properties of AL-monoids. Also, we prove that Autometrized lattice ordered…

We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operads obtained from usual monoids such as the additive and multiplicative…

Pseudo-effect algebras are partial algebraic structures, that were introduced as a non-commutative generalization of effect algebras. In the present paper, lattice ordered pseudo-effect algebras are considered as possible algebraic…