Principal and Boolean congruences on \theta-valued Lukasiewicz-Moisil algebras
A. V. Figallo, I. Pascual y A. Ziliani

TL;DR
This paper investigates principal and Boolean congruences on heta-valued Lukasiewicz-Moisil algebras, providing characterizations and duality-based insights into their structure, especially for finite n-valued cases.
Contribution
It characterizes principal and Boolean congruences on LM heta-algebras using topological duality and establishes conditions for when principal congruences are Boolean, especially for finite n.
Findings
Intersection of two principal -congruences is principal
Boolean congruences are principal and -congruences
Conditions for principal congruences to be Boolean
Abstract
The first system of many-valued logic was introduced by J. Lukasiewicz, his motivation was of philosophical nature as he was looking for an interpretation of the concepts of possibility and necessity. Since then, plenty of research has been developed in this area. In 1968, when Gr.C. Moisil came across Zadeh's fuzzy set theory he found the motivation he had been looking for in order to legitimate the introduction and study of infinitely-valued Lukasiewicz algebras, so he defined \theta-valued Lukasiewicz algebras (or LM\theta-algebras, for short) (without negation), where \theta is the order type of a chain. In this article, our main interest is to investigate the principal and Boolean congruences and \theta-congruences on LM\theta-algebras. In order to do this we take into account a topological duality for these algebras obtained in (A.V. Figallo, I. Pascual, A. Ziliani, A Duality for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Rough Sets and Fuzzy Logic · Fuzzy and Soft Set Theory
