Monadic bounded hoops

Monadic bounded hoops
复制标题

DOI:
10.1007/s00500-017-2648-x
复制
发表时间:
2018-03
期刊:
影响因子:
4.1
通讯作者:
Juntao Wang;X. Xin;Pengfei He
Juntao Wang;X. Xin;Pengfei He
中科院分区:
计算机科学3区
文献类型:
--
作者:
Juntao Wang;X. Xin;Pengfei He

文献摘要

被引文献

相似文献

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 setof all monadic filters on monadic bounded hoops and obtain thatforms 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.