Abstract
A rough set logic based on Heyting-Brouwer algebras HBRSL is proposed as a basis for reasoning about rough information. It is an extension of Düntsch’s logic with intuitionistic implication, and is seen as a variant of Heyting-Brouwer logic. A Kripke semantics and natural deduction for the logic are presented and the completeness theorem is proved.
Author supplied keywords
Cite
CITATION STYLE
APA
Akama, S., Murai, T., & Kudo, Y. (2014). Heyting-Brouwer rough set logic. In Advances in Intelligent Systems and Computing (Vol. 245, pp. 135–145). Springer Verlag. https://doi.org/10.1007/978-3-319-02821-7_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free