We study conditions under which the lattice of ideals of a given a commutative semiring is complemented. At first we check when the annihilator of a given ideal of is a complement of . Further, we study complements of annihilator ideals. Next we investigate so-called Łukasiewicz semirings. These form a counterpart to MV-algebras which are used in quantum structures as they form an algebraic semantic of many-valued logics as well as of the logic of quantum mechanics. We describe ideals and congruence kernels of these semirings with involution. Finally, using finite unitary Boolean rings, a construction of commutative semirings with complemented lattice of ideals is presented.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC6559127 | PMC |
http://dx.doi.org/10.1007/s00500-018-3493-2 | DOI Listing |
Entropy (Basel)
August 2019
Department of Signal Theory and Communications, Universidad Carlos III de Madrid, 28911 Leganés, Spain.
We set out to demonstrate that the Rényi entropies are better thought of as operating in a type of non-linear semiring called a positive semifield. We show how the Rényi's postulates lead to Pap's g-calculus where the functions carrying out the domain transformation are Rényi's information function and its inverse. In its turn, Pap's g-calculus under Rényi's information function transforms the set of positive reals into a family of semirings where "standard" product has been transformed into sum and "standard" sum into a power-emphasized sum.
View Article and Find Full Text PDFSoft comput
August 2018
1Department of Algebra and Geometry, Faculty of Science, Palacký University Olomouc, 17. listopadu 12, 771 46 Olomouc, Czech Republic.
We study conditions under which the lattice of ideals of a given a commutative semiring is complemented. At first we check when the annihilator of a given ideal of is a complement of . Further, we study complements of annihilator ideals.
View Article and Find Full Text PDFIEEE Trans Pattern Anal Mach Intell
July 2015
Many inference tasks in pattern recognition and artificial intelligence lead to partition functions in which addition and multiplication are abstract binary operations forming a commutative semiring. By generalizing max-sum diffusion (one of convergent message passing algorithms for approximate MAP inference in graphical models), we propose an iterative algorithm to upper bound such partition functions over commutative semirings. The iteration of the algorithm is remarkably simple: change any two factors of the partition function such that their product remains the same and their overlapping marginals become equal.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!