Abstract
We present general principles of establishing a duality between a class of algebras and a class of relational systems such that topology is not involved. We show how such a discrete duality contributes to proving completeness of logical systems and to correspondence theory. Next, we outline applications of discrete dualities to analysis of data in information systems with incomplete information in the rough set-style, and in contexts of formal concept analysis.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Cignoli, R., Laflace, S., Petrovich, A.: Remarks on Priestley duality for distributive lattices. Order 8, 299–315 (1991)
Düntsch, I., Orłowska, E., Radzikowska, A.: Lattice-based relation algebras II. LNCS (LNAI), vol. 4342, pp. 267–289. Springer, Heidelberg (2006)
Düntsch, I., Orłowska, E., Radzikowska, A., Vakarelov, D.: Relational representation theorems for some lattice-based structures. Journal of Relational Methods in Computer Science 1, 132–160 (2005)
Dzik, W., Orłowska, E., van Alten, C.: RelMiCS/AKA 2006. LNCS, vol. 4136, pp. 162–176. Springer, Heidelberg (2006)
Dzik, W., Orłowska, E., van Alten, C.: Relational representation theorems for lattices with negations: A survey. LNCS (LNAI), vol. 4342, pp. 245–266. Springer, Heidelberg (2006)
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin (1999)
Goldblatt, R.: On closure under canonical embedding algebras, Colloquia Mathematica Societatis Janos Bolyai, Budapest, Hungary. Algebraic Logic, vol. 54, pp. 217–229 (1988)
Goldblatt, R.: Varieties of complex algebras. Annals of Pure and Applied Logic 44, 173–242 (1989)
Järvinen, J., Orłowska, E.: Relational correspondences for lattices with operators. LNCS, vol. 3929, pp. 134–146. Springer, Heidelberg (2006)
Jónson, B., Tarski, A.: Boolean algebras with operators, Part I American Journal of Mathematics 73, 891–939 (1951) Part II ibidem 74, 127–162 (1952)
Maksimova, L.L.: Pretabular superintuitionistic logics. Algebra and Logic 11(5), 558–570 (1972)
Maksimova, L.L.: Pretabular extensions of the Lewis’ logic S4. Algebra and Logic 14(1), 28–55 (1975)
Orłowska, E., Radzikowska, A.: Relational representability for algebras of substructural logics. LNCS, vol. 3929, pp. 212–224. Springer, Heidelberg (2006)
Orłowska, E., Radzikowska, A.: Representation theorems for some fuzzy logics based on residuated non-distributive lattices (submitted)
Orłowska, E., Rewitzky, I.: Discrete duality for Heyting algebras with operators preprint) (2007)
Orłowska, E., Rewitzky, I.: Discrete duality for context and concepts from formal concept analysis (submitted 2007)
Orłowska, E., Rewitzky, I., Düntsch, I.: Relational semantics through duality. LNCS, vol. 3929, pp. 17–32. Springer, Heidelberg (2006)
Orłowska, E., Rewitzky, I.: Duality via Truth: semantic frameworks for lattice-based logics. Logic Journal of the IGPL 13, 467–490 (2005)
rłowska, E., Vakarelov, D.: Lattice-based modal algebras and modal logics. In: Hajek, P., Valdés-Villanueva, L.M., Westerstahl, D. (eds.) Proceedings of the 12th International Congress. Logic, Methodology and Philosophy of Science, pp. 147–170. King’s College London Publications, London (2005)
Pawlak, Z.: Rough Sets - Theoretical Aspects of Reasoning about Knowledge. Kluwer, Dordrecht (1991)
Priestley, H.A.: Representation of distributive lattices by means of ordered Stone spaces. Bulletin of the London Mathematical Society 2, 186–190 (1970)
Priestley, H.A.: Ordered topological spaces and the representation of distributive lattices. In: Proceedings of the London Mathematical Society, vol. 24, pp. 507–530 (1972)
Stone, M.: The theory of representations of Boolean algebras. Transactions of the American Mathematical Society 40, 37–111 (1936)
Urquhart, A.: A topological representation theory for lattices. Algebra Universalis 8, 45–58 (1978)
Wille, R.: Restructuring lattice theory: An approach based on hierarchies of concepts. In: Rival, I. (ed.): Ordered sets, NATO Advanced Studies Institute, Reidel, Dordrecht, vol. 83, pp. 445–470 (1982)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Orłowska, E., Rewitzky, I. (2007). Discrete Duality and Its Applications to Reasoning with Incomplete Information. In: Kryszkiewicz, M., Peters, J.F., Rybinski, H., Skowron, A. (eds) Rough Sets and Intelligent Systems Paradigms. RSEISP 2007. Lecture Notes in Computer Science(), vol 4585. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73451-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-73451-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73450-5
Online ISBN: 978-3-540-73451-2
eBook Packages: Computer ScienceComputer Science (R0)