Results 181 to 190 of about 3,245 (221)

AGGREGATION AND IDEMPOTENCE

The Review of Symbolic Logic, 2013
AbstractA 1-ary sentential context is aggregative (according to a consequence relation) if the result of putting the conjunction of two formulas into the context is a consequence (by that relation) of the results of putting first the one formula and then the other into that context.
openaire   +3 more sources

DISTRIBUTIVE IDEMPOTENT UNINORMS

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2003
A characterization of all idempotent uninorms satisfying the distributive property is given. The special cases of left-continuous and right-continuous idempotent uninorms are presented separately and it is also proved that all idempotent uninorms are autodistributive.
Daniel Ruiz 0001, Joan Torrens
openaire   +3 more sources

ON THE IDEMPOTENCY AND CO-IDEMPOTENCY OF THE MORPHOLOGICAL CENTER

International Journal of Pattern Recognition and Artificial Intelligence, 2001
By a novel use of distributivity we obtain polynomial time algorithms to decide whether or not a given min–max operator (stack filter) is idempotent or not. Several properties related to idempotency can also be tested in polynomial time. In particular we apply these results to the morphological center of two operators.
openaire   +1 more source

Idempotents in R

Mathematical Logic Quarterly, 1986
DeMorgan monoids stand to the relevant logic R as Boolean algebras do to classical logic, or as Heyting lattices do to intuitionistic logic. By an idempotent in a DeMorgan monoid we mean an element a such that \(a\circ a=a\), where \(\circ\) is the fusion (or consistency) operation defined by \(b\circ c=\sim (b\to \sim c)\).
openaire   +3 more sources

QUASIVARIETIES OF IDEMPOTENT SEMIGROUPS

International Journal of Algebra and Computation, 2003
It is proved that the lattice L(Bd) of quasivarieties contained in the variety Bdof idempotent semigroups contains an isomorphic copy of the ideal lattice of a free lattice on ω free generators. This result shows that a problem of Petrich [19], which calls for a description of L(Bd), is much more complex than originally expected.
M. E. Adams, Wieslaw Dziobiak
openaire   +2 more sources

Idempotent uninorms

European Journal of Operational Research, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Idempotence is not a medical condition

Communications of the ACM, 2012
Messages may be retried. Idempotence means that's OK.
openaire   +2 more sources

THE IDEMPOTENTS IN A PERIODIC SEMIGROUP

International Journal of Algebra and Computation, 1996
Let [Formula: see text] be the semigroup variety determined by the identity xm=xm+k. For [Formula: see text] we define operations on the set E(S) of idempotents of S and thus obtain the idempotent algebra of S. For any subvariety [Formula: see text] of [Formula: see text] the idempotent algebras of the members of [Formula: see text] form a variety ...
openaire   +3 more sources

On Idempotent and Hyperassociative Structures

Lobachevskii Journal of Mathematics, 2019
An algebra with binary operations is called a binary algebra. A binary algebra \((Q;\Sigma)\) is said to be 1) hyperassociative if \(X(x,Y(y,z))=Y(X(x,y),z)\) for every operations \(X,Y\in\Sigma\), 2) rectangular if \(X(x,X(y,x))=x\) for every operation \(X\in\Sigma\). The main result of the paper under review is Theorem 4.
Movsisyan, Yu., Yolchyan, Marlen
openaire   +1 more source

IDEMPOTENT POINTLIKE SETS

International Journal of Algebra and Computation, 2004
In this paper we answer a question posed by John Rhodes: "What are the aperiodic-idempotent-pointlike subsemigroups of S?" Answer: Precisely those aperiodic-pointlike subsemigroups that are idempotents, i.e. EPlA(S)={X|X≤E=E2∈PlA(S)}. In the proof we define, for a given variety V (closed under n-tuple expansion) and a given relation R:S-V∈V computing ...
openaire   +2 more sources