Ideal extensions of ordered sets.
Ideal independence, free sequences, and the ultrafilter number
We make use of a forcing technique for extending Boolean algebras. The same type of forcing was employed in Baumgartner J.E., Komjáth P., Boolean algebras in which every chain and antichain is countable, Fund. Math. 111 (1981), 125–133, Koszmider P., Forcing minimal extensions of Boolean algebras, Trans. Amer. Math. Soc. 351 (1999), no. 8, 3073–3117, and elsewhere. Using and modifying a lemma of Koszmider, and using CH, we obtain an atomless BA, such that , answering questions raised by Monk...
Ideal nil-extensions of semigroups with semimodular congruence lattices.
Ideal systems and lattice theory.
Ideal systems of intersection and product type
Ideal theory in commutative semigroups.
Ideale in Rechtsverbandshalbgruppen.
Ideals and Green's relations in ordered semigroups.
Ideals, congruences and annihilators on nearlattices
By a nearlattice is meant a join-semilattice having the property that every principal filter is a lattice with respect to the semilattice order. We introduce the concept of (relative) annihilator of a nearlattice and characterize some properties like distributivity, modularity or -distributivity of nearlattices by means of certain properties of annihilators.
Ideals in distributive posets
We prove that any ideal in a distributive (relative to a certain completion) poset is an intersection of prime ideals. Besides that, we give a characterization of n-normal meet semilattices with zero, thus generalizing a known result for lattices with zero.
Ideals, -rings and -algebras
Ideals of binary relational systems
Ideals of noncommutative -monoids
In this paper, we introduce the concept of an ideal of a noncommutative dually residuated lattice ordered monoid and we show that congruence relations and certain ideals are in a one-to-one correspondence.
Ideals of weakly associative lattices and pseudo-ordered sets
Idéaux et congruences dans un treillis
Idempotency of Circuit-induced Exchange Operators.
Idempotent distributive semirings II..
Idempotent generated algebras and Boolean pairs
Idempotent semigroups and tropical algebraic sets
The tropical semifield, i.e., the real numbers enhanced by the operations of addition and maximum, serves as a base of tropical mathematics. Addition is an abelian group operation, whereas the maximum defines an idempotent semigroup structure. We address the question of the geometry of idempotent semigroups, in particular, tropical algebraic sets carrying the structure of a commutative idempotent semigroup. We show that commutative idempotent semigroups are contractible, that systems of tropical...
Idempotent versions of Haar’s Lemma: links between comparison of discrete event systems with different state spaces and control
Haar's Lemma (1918) deals with the algebraic characterization of the inclusion of polyhedral sets. This Lemma has been involved many times in automatic control of linear dynamical systems via positive invariance of polyhedrons. More recently, it has been used to characterize stochastic comparison w.r.t. linear/integral ordering of Markov (reward) chains. In this paper we develop a state space oriented approach to the control of Discrete Event Systems (DES) based on the remark that most of control...