Abstract
In this paper, we introduced the notion of n-fold obstinate filter in BL-algebras and we stated and proved some theorems, which determine the relationship between this notion and other types of n-fold filters in a BL-algebra. We proved that if F is a 1-fold obstinate filter, then A/F is a Boolean algebra. Several characterizations of n-fold fantastic filters are given, and we show that A is a n-fold fantastic BL-algebra if A is a MV-algebra (n ≥ 1) and A is a 1-fold positive implicative BL-algebra if A is a Boolean algebra. Finally, we construct some algorithms for studying the structure of the finite BL-algebras and n-fold filters in finite BL-algebras.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
