Abstract
In this paper we introduce the notion of obstinate filter in BL-algebra A and we state and prove some theorems which determine the relationship between this notion and other types of filters of a BL-algebra and by some examples we show that this notion is different. Also, we prove that if F is an obstinate filter, then F is a Boolean filter hence A/F is a Boolean algebra. Finally, we construct some algorithms for studying the structure of the finite BL-algebras and 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.
