English
Related papers

Related papers: Pseudocomplementation and Minimal Prime Ideals in …

200 papers

A lattice-theoretic framework is introduced that permits the study of the conditional independence (CI) implication problem relative to the class of discrete probability measures. Semi-lattices are associated with CI statements and a…

Artificial Intelligence · Computer Science 2008-11-03 Mathias Niepert , Dirk Van Gucht , Marc Gyssens

We define a quasimodule Q over a bounded lattice L in an analogous way as a module over a semiring is defined. The essential difference is that L need not be distributive. Also for quasimodules there can be introduced the concepts of inner…

Rings and Algebras · Mathematics 2024-11-04 Ivan Chajda , Helmut Länger

In this paper we explore which part of the ideal lattice of a general ring is parametrized by its Cuntz semigroup $\mathrm{S}(R)$ and its ambient semigroup $\Lambda(R)$. We identify these classes of ideals as the quasipure ideals (a…

Rings and Algebras · Mathematics 2024-11-04 Ramon Antoine , Pere Ara , Joan Bosa , Francesc Perera , Eduard Vilalta

Let $R$ be a ring, $\CC_R$ and $\pCCR$ be the set of regular and left regular elements of $R$ ($\CC_R\subseteq \pCCR$). Goldie's Theorem is a semisimplicity criterion for the classical left quotient ring $Q_{l,cl}(R):=\CC_R^{-1}R$.…

Rings and Algebras · Mathematics 2015-04-29 V. V. Bavula

For every semilattice $\mathcal{S}=(S,+)$, the set $\mathrm{End}(\mathcal{S})$ of its endomorphisms forms a semiring under point-wise addition and composition. We prove that the semiring of all endomorphisms of the 3-element chain has no…

Group Theory · Mathematics 2026-05-05 Sergey V. Gusev , Mikhail V. Volkov

This work is a review of results about centrally essential rings and semirings. A ring (resp., semiring) is said to be centrally essential if it is either commutative or satisfy the property that for any non-central element $a$, there exist…

Rings and Algebras · Mathematics 2022-05-31 Askar Tuganbaev

This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…

Rings and Algebras · Mathematics 2013-04-02 G. Grätzer , E. T. Schmidt

We present a study of semigroup compactifications of a semitopological semigroup $S$ using certain filters on $S$. We characterize closed subsemigroups and closed left, right, and two-sided ideals in any semigroup compactification of any…

General Topology · Mathematics 2013-07-12 Tomi Alaste

We define a notion of ideal for objects in the category of abstract unitary Cuntz semigroups introduced in [3] and termed Cu$^\sim$. We show that the set of ideals of a Cu$^\sim$-semigroup has a complete lattice structure. In fact, we prove…

Operator Algebras · Mathematics 2021-07-07 Laurent Cantier

We propose a new class of mathematical structures called (m,n)-semirings} (which generalize the usual semirings), and describe their basic properties. We also define partial ordering, and generalize the concepts of congruence, homomorphism,…

General Mathematics · Mathematics 2013-04-25 Syed Eqbal Alam , Shrisha Rao , Bijan Davvaz

In this paper we primarily study monomial ideals and their minimal free resolutions by studying their associated LCM lattices. In particular, we formally define the notion of coordinatizing a finite atomic lattice P to produce a monomial…

Commutative Algebra · Mathematics 2010-09-09 Sonja Mapes

Every reduced ring $R$ has a natural partial order defined by $a\le b$ if $a^2=ab$; it generalizes the natural order on a boolean ring. The article examines when $R$ is a lower semi-lattice in this order with examples drawn from weakly Baer…

Rings and Algebras · Mathematics 2018-02-21 W. D. Burgess , R. Raphael

Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…

Algebraic Geometry · Mathematics 2017-09-21 Guillaume Tahar

We initiate the study of pseudofiniteness in continuous logic. We introduce a related concept, namely that of pseudocompactness, and investigate the relationship between the two concepts. We establish some basic properties of…

Logic · Mathematics 2016-02-10 Isaac Goldbring , Vinicius Cifu Lopes

Flat modules play an important role in the study of the category of modules over rings and in the characterization of some classes of rings. We study the e-flatness for semimodules introduced by the first author using his new notion of…

Rings and Algebras · Mathematics 2025-10-28 Jawad Abuhlail , Rangga Ganzar Noegraha

Semiring semantics for first-order logic provides a way to trace how facts represented by a model are used to deduce satisfaction of a formula. Team semantics is a framework for studying logics of dependence and independence in diverse…

Logic in Computer Science · Computer Science 2023-03-15 Timon Barlag , Miika Hannula , Juha Kontinen , Nina Pardal , Jonni Virtema

For commutative rings with identity, we introduce and study the concept of semi $r$-ideals which is a kind of generalization of both $r$-ideals and semiprime ideals. A proper ideal $I$ of a commutative ring $R$ is called semi $r$-ideal if…

Commutative Algebra · Mathematics 2022-10-04 Hani A. Khashan , Ece Yetkin Celikel

In the last decades the Moore-Penrose pseudoinverse has found a wide range of applications in many areas of Science and became a useful tool for physicists dealing, for instance, with optimization problems, with data analysis, with the…

Mathematical Physics · Physics 2015-06-03 J. C. A. Barata , M. S. Hussein

Based on the minimal and simple representations, we introduce two Jacobson-type Hoehnke radicals, m-radical and s-radical, of a semiring $S$. Every minimal (simple) $S$-semimodule is a quotient of $S$ by a regular right congruence (maximal)…

Rings and Algebras · Mathematics 2023-06-30 A. K. Bhuniya , Puja Sarkar

For several semirings S, two weighted finite automata with multiplicities in S are equivalent if and only if they can be connected by a chain of simulations. Such a semiring S is called "proper". It is known that the Boolean semiring, the…

Formal Languages and Automata Theory · Computer Science 2015-03-14 Zoltan Esik , Andreas Maletti