Results 171 to 180 of about 340,049 (197)
Some of the next articles are maybe not open access.
Conrad’s F-condition for partially ordered monoids
Soft Computing, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pengyuan Liu +2 more
openaire +3 more sources
On Morita Equivalence of Partially Ordered Monoids
Applied Categorical Structures, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
SECOND ORDER DEHN FUNCTIONS OF GROUPS AND MONOIDS
International Journal of Algebra and Computation, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
X. Wang, Stephen J. Pride
openaire +2 more sources
Finite J-Trivial Monoids and Partially Ordered Monoids
1987An important result in the theory of automata, due to Imre Simon, characterizes the recognizable languages whose syntactic monoids are J-trivial. This theorem has an easy, although not entirely obvious, restatement as a global structure theorem for finite J-trivial monoids, asserting that every finite J-trivial monoid is a quotient of a finite monoid ...
Howard Straubing, Denis Thérien
openaire +1 more source
Inverse Monoids With a Natural Semilattice Ordering
Proceedings of the London Mathematical Society, 1995The thesis of this paper is that many naturally occurring examples of inverse semigroups are endowed with extra structure; typically, they are inverse monoids in which the natural partial order forms a meet semilattice. Inverse semigroups of this kind the author terms inverse algebras.
openaire +2 more sources
Orbit decompositions of orthogonal monoids and the orders of finite orthogonal monoids
Semigroup Forum, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cao, You'an, Li, Zhenheng, Lei, Jie
openaire +1 more source
DISCRETE ORDERINGS AND COMMUTATIVE MONOIDS
Communications in Algebra, 2001We show that a countable totally and discretely ordered set with first element inherently carries the structure of an ordered commutative euclidean monoid, provided its order type is of a certain kind. As an application we specify the order types of all discretely ordered sets which can be expanded to ordered commutative euclidean monoids.
openaire +1 more source
And... Action! – Monoid Actions and (Pre)orders
2014Orders occur naturally in many areas of computer science and mathematics. In several cases it is very simple do describe an order mathematically, but it may be cumbersome to implement in some programming language. On the other hand many order relations are defined in terms of an existential quantification.
openaire +1 more source
Residuation in commutative ordered monoids with minimal zero
Reports Math. Log., 2000The authors define a new algebraic system called semi-integral residuated commutative monoid (sircomonoid). An algebra \(B= \langle B;\oplus,\mathop{\dot-},0\rangle\) of type \(\langle 2,2,0\rangle\) is called a sircomonoid if it satisfies that for \(a,b,c\in B\), (i) \(\langle B;\oplus,0\rangle\) is a commutative monoid; (ii) the relation \(\leq ...
James G. Raftery 0001 +1 more
openaire +2 more sources