Abstract
We give an axiomatic system of a logic characterized by the class of Boolean algebras with conjugate, which has a close connection with the theory of rough sets, and prove that the logic is decidable.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Järvinen, J., Kortelainen, J.: A unifying study between modal-like operators, topologies, and fuzzy sets, TUCS Technical report, 642 (2004)
Jónsson, B., Tarski, A.: Boolean algebras with operators. Part 1., American Journal of Mathematics 73, 891–939 (1951)
Goldblatt, R.: Logics of time and computation, CSLI Lecture Notes No.7 (1987)
Lemmon, E.J.: New foundation for Lewis modal systems. Journal of Symbolic Logic 22, 176–186 (1957)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kondo, M., Nakamatsu, K., Abe, J.M. (2006). Logic Determined by Boolean Algebras with Conjugate. In: Gabrys, B., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2006. Lecture Notes in Computer Science(), vol 4252. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11893004_111
Download citation
DOI: https://doi.org/10.1007/11893004_111
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46537-9
Online ISBN: 978-3-540-46539-3
eBook Packages: Computer ScienceComputer Science (R0)