Related papers: Filters and ideals in pseudocomplemented posets
We show that the theories of partially ordered sets, lattices, semilattices, Boolean algebras, Heyting algebras with a further coarser partial order, or a linearization, or an auxiliary relation have the strong amalgamation property,…
Suppose that R is an analytically irreducible or excellent local domain with maximal ideal m_R. We consider multiplicities and mixed multiplicities of R by filtrations of m_R-primary ideals. We show that the theorem of Teissier, Rees and…
This paper is devoted to a detailed study of certain remarkable posets which form a natural partition of all abelian ideals of a Borel subalgebra. Our main result is a nice uniform formula for the dimension of maximal ideals in these…
Taking a ring-theoretic perspective as our motivation, the main aim of this series is to establish a comprehensive theory of ideals in commutative quantales with an identity element. This particular article focuses on an examination of…
In this paper, we continue the study of quantum B-algebras with emphasis on filters on integral quantum B-algebras. We then study filters in the setting of pseudo-hoops. First, we establish an embedding of a cartesion product of polars of a…
Analogues of Eakin-Sathaye theorem for reductions of ideals are proved for ${\mathbb N}^s$-graded good filtrations. These analogues yield bounds on joint reduction vectors for a family of ideals and reduction numbers for $\mathbb N$-graded…
We introduce an interesting method of proving separable reduction theorems - the method of elementary submodels. We are studying whether it is true that a set (function) has given property if and only if it has this property with respect to…
We study contact posets and show that every contact poset can be embedded into a Boolean poset with overlap contact relation. Contact posets and (nonadditive) contact semilattices have the superamalgamation property, Fra\"\i ss\'e limits…
It is known that every relatively pseudocomplemented lattice is residuated and, moreover, it is distributive. Unfortunately, non-distributive lattices with a unary operation satisfying properties similar to relative pseudocomplementation…
We show that a not necessarily closed ideal in a C*-algebra is semiprime if and only if it is idempotent, if and only if it is closed under square roots of positive elements. Among other things, it follows that prime and semiprime ideals in…
We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…
A distributive lattice $L$ with minimum element $0$ is called decomposable lattice if $a$ and $b$ are not comparable elements in $L$ there exist $\overline{a},\overline{b}\in L$ such that $a=\overline{a}\vee(a\wedge b),…
We show that many large cardinal notions up to measurability can be characterized through the existence of certain filters for small models of set theory. This correspondence will allow us to obtain a canonical way in which to assign ideals…
We continue algebraization of the set of ultrafilters on a metric spaces initiated in [6]. In particular, we define and study metric counterparts of prime, strongly prime and right cancellable ultrafilters from the Stone-$\check{C}$ech…
In this work, we establish separation theorems for several subsystems of the Ideal Proof System (IPS), an algebraic proof system introduced by Grochow and Pitassi (J. ACM, 2018). Separation theorems are well-studied in the context of…
In this paper, we prove prime avoidance for ringoids. We also generalize McCoy's and Davis' prime avoidance theorems in the context of semiring theory. Next, we proceed to define and characterize compactly packed semirings and show that a…
Using the theory of Dixmier ideals developed in previous work, we show that every semiprime Lie ideal in a C*-algebra arises as the full normalizer subspace of a semiprime two-sided ideal. This leads to a concise description of all…
For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…
We study a class of determinantal ideals arising from conditional independence (CI) statements with hidden variables. Such CI statements translate into determinantal conditions on a matrix whose entries represent the probabilities of events…
For a poset $(P;\leq)$, the quasiorders (AKA preorders) extending the poset order "$\leq$" form a complete lattice $F$, which is a filter in the lattice of all quasiorders of the set $P$. We prove that if the poset order "$\leq$" is small,…