Results 21 to 30 of about 276 (101)
The coextension of commutative pomonoids and its application to triangular norms [PDF]
Quaestiones Mathematicae, 2018 Group coextensions of monoids, which generalise Schreier-type extensions of groups, have originally been defined by P.A. Grillet and J. Leech. The present paper deals with pomonoids, that is, monoids that are endowed with a compatible partial order. Following the lines of the unordered case, we define pogroup coextensions of pomonoids.
Jiří Janda, Thomas Vetterlein
openalex +3 more sources
On a generalization of I-regularity
Open MathematicsLet SS be a pomonoid. The projectivity and strong flatness of right SS-posets have been central topics in the homological classification of pomonoids in recent decades. In 2005, Shi et al. introduced II-regular SS-posets and proved that all its cyclic SS-
Qiao Husheng, Feng Leting
doaj +2 more sources
On homological classification of pomonoids by regular weak injectivity properties of S-posets
Open Mathematics, 2006 Abstract If S is a partially ordered monoid then a right S-poset is a poset A on which S acts from the right in such a way that the action is compatible both with the order of S and A. By regular weak injectivity properties we mean injectivity properties with respect to all regular monomorphisms (not all monomorphisms) from different ...
Xia Zhang, Valdis Laan
openalex +3 more sources
Directed colimits of some flatness properties and purity of epimorphisms in S-posets
Open Mathematics, 2018 Let S be a pomonoid. In this paper, we introduce some new types of epimorphisms with certain purity conditions, and obtain equivalent descriptions of various flatness properties of S-posets, such as strong flatness, Conditions (E), (E′), (P), (Pw), (WP),
Liang Xingliang, Khosravi Roghaieh
doaj +2 more sources
Subpullbacks and Po-flatness Properties of S-posets [PDF]
Journal of Sciences, Islamic Republic of Iran, 2014 In (Golchin A. and Rezaei P., Subpullbacks and flatness properties of S-posets. Comm. Algebra. 37: 1995-2007 (2009)) study was initiated of flatness properties of right -posets over a pomonoid that can be described by surjectivity of corresponding to ...
A. Golchin, L. Nouri
doaj +2 more sources
Absolute flatness and amalgams in pomonoids
Semigroup Forum, 1986 We define a tensor product for partially ordered sets acted on by a partially ordered monoid and study the related property of absolute flatness. As a by-product we show that a partially ordered commutative group is a strong amalgamation base in the category of partially ordered commutative monoids. This result originally due to Schreier in the case of
Syed M. Fakhruddin
openalex +2 more sources
Varieties of Commutative Residuated Integral Pomonoids and Their Residuation Subreducts
Journal of Algebra, 1997 Let \(\langle A;\oplus ,0,\leq \rangle\) be a commutative (dually) integral partially ordered monoid whose identity \(0\) is the least element of \(\langle A,\leq \rangle\), where \(\leq\) is a partial order compatible with the monoid operation \(\oplus\) in the sense that \(a\oplus b\leq c\oplus d\) whenever \(a\leq c\) and \(b\leq d\).
W. J. Blok, James Raftery
openalex +3 more sources
On the homological classification of pomonoids by their Rees factor S-posets
Open Mathematics, 2009 AbstractThe original version of the article was published in Central European Journal of Mathematics, 2007, 5(1), 181–200, DOI: 10.2478/s11533-006-0036-3. Unfortunately, the original version of this article contains a mistake: in Theorem 5.2 only conditions (i) and (ii) (and not (iii)) are equivalent. We correct the theorem and its proof.
Husheng Qiao, Zhongkui Liu
openalex +3 more sources
Unitary posets and amalgamations of pomonoids [PDF]
, 2014 In 1927, Schreier proved that amalgams of groups are always embeddable in the category of groups. However, this is not true in the category of semigroups, as shown by Kimura.
Bana Al Subaiei
openalex +1 more source
Graded Hoare Logic and its Categorical Semantics [PDF]
Programming Languages and Systems30th European Symposium on Programming, 2021 Deductive verification techniques based on program logics (i.e., the family of Floyd-Hoare logics) are a powerful approach for program reasoning. Recently, there has been a trend of increasing the expressive power of such logics by augmenting their rules
Gaboardi M +3 more
europepmc +4 more sources