.png){kind=icon}
.png){kind=icon}
Return
Monadic bounded hoops
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-017-2648-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The main goal of this paper is to investigate monadic bounded hoops and prove the completeness of the monadic hoop logic. In the paper, we introduce monadic bounded hoops: A variety of bounded hoops equipped with universal and existential quantifiers. Also, we study some properties of them and obtain some conditions under which a bounded hoop becomes a Heyting algebra and BL-algebra. In addition, we introduce and investigate monadic filters in monadic bounded hoops. Using monadic filters on monadic bounded hoops, we characterize simple monadic bounded hoops. Moreover, we focus on algebraic structures of the set of all monadic filters on monadic bounded hoops and obtain that forms a complete Heyting algebra. Further, we discuss relations between monadic bounded hoops and some related algebraic structures, likeness other monadic algebras, bounded hoops with regular Galois connection and rough approximation spaces. Finally, as an application of monadic bounded hoops, we prove the completeness of monadic hoop logic. These results will provide a more general algebraic foundations of soft computing intended as a method for dealing with uncertain information, fuzzy information and decision making.
Keywords:
Logical algebra
Hoop
Quantifier
Monadic filter
Monadic hoop logic
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.