Abstract
Subsequently, we introduce a reasoning formalism which in particular allows to express that certain sets in a system of subsets of a given set are disjoint. The main purpose of considering such a family of subsets is to be able to investigate how knowledge grows as subsets shrink in the course of time. We actually introduce a trimodal logic: we have a system containing operators for knowledge and time, of which the latter corresponds to the effort of measurement and reminds of the nexttime operator of temporal logic; an operator separating sets is added then. Socalled subset tree models appear as the relevant semantical structures.We present an axiomatization of the set of valid formulas encompassing the three operators and their interaction. Afterwards the completeness of the given axiomatization is proved. We also give arguments showing 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.
Similar content being viewed by others
References
Chellas, B.F.: Modal Logic: An Introduction. Cambridge University Press, Cambridge (1980)
Artemov, S., Davoren, J., Nerode, A.:. Topological Semantics for Hybrid Systems. In: Adian, S., Nerode, A. (eds.): Logical Foundations of Computer Science, LFCS’97. Lecture Notes in Computer Science, Vol. 1234. Springer-Verlag, Berlin Heidelberg New York (1997) 1–8
Dabrowski, A., Moss, L.S., Parikh, R.: Topological Reasoning and The Logic of Knowledge. Annals of Pure and Applied Logic 78 (1996) 73–110
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press, Cambridge (Mass.) (1995)
Georgatos, K.: Knowledge Theoretic Properties of Topological Spaces. In: Masuch, M., Polos, L. (eds.): Knowledge Representation and Uncertainty. Lecture Notes in Computer Science, Vol. 808. Springer-Verlag, Berlin Heidelberg New York (1994) 147–159
Georgatos, K.: Reasoning about Knowledge on Computation Trees. In: MacNish, C., Pearce, D., Pereira, L.M. (eds.): Logics in Artificial Intelligence, JELIA’94. Lecture Notes in Computer Science, Vol. 838. Springer-Verlag, Berlin Heidelberg New York (1994) 300–315
Georgatos, K.: private communication
Goldblatt, R.: Logics of Time and Computation. Center for the Study of Language and Information, Stanford (1987)
Heinemann, B.: ‘Topological’ Modal Logic of Subset Frames with Finite Descent. In: Kautz, H., Selman, B. (eds.): Proceedings of the Fourth International Symposium on Artificial Intelligence and Mathematics, AI/MATH-96. Fort Lauderdale (1996) 83–86
Heinemann, B.: On binary computation structures. Mathematical Logic Quaterly 43 (1997) 203–215
Heinemann, B.: A topological generalization of propositional linear time temporal logic. In: Prívara, I., Ružička, P. (eds.): Mathematical Foundations of Computer Science (22nd International Symposium, MFCS’97). Lecture Notes in Computer Science, Vol. 1295. Springer-Verlag, Berlin Heidelberg New York (1997) 289–297
Heinemann, B.: Including Separation in the Modal Logic of Subset Spaces. Technical Report, No. 231. FernUniversität, Hagen (1998)
Ladner, R.E.: The Computational Complexity of Provability in Systems of Modal Propositional Logic. SIAM Journal of Computing 6 (1977) 467–480
Marx, M., Venema, Y.: Multi-Dimensional Modal Logic. Kluwer, Dordrecht (1996)
Moss, L.S., Parikh R.: Topological Reasoning and The Logic of Knowledge. In: Moses, Y. (ed.): Theoretical Aspects of Reasoning about Knowledge, TARK 1992. Morgan Kaufmann, San Francisco (1992) 95–105
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heinemann, B. (1998). Separating Sets by Modal Formulas. In: Haeberer, A.M. (eds) Algebraic Methodology and Software Technology. AMAST 1999. Lecture Notes in Computer Science, vol 1548. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49253-4_12
Download citation
DOI: https://doi.org/10.1007/3-540-49253-4_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65462-9
Online ISBN: 978-3-540-49253-5
eBook Packages: Springer Book Archive