Abstract
This paper presents a bimodal logic for reasoning about knowledge during knowledge acquisitions. One of the modalities represents (effort during) non-deterministic time and the other represents knowledge. The semantics of this logic are tree-like spaces which are a generalization of semantics used for modeling branching time and historical necessity. A finite system of axiom schemes is shown to be canonically complete for the formentioned spaces. A characterization of the satisfaction relation implies the small model property and decidability for this system.
Similar content being viewed by others
References
Chandy, M., and J. Misra, 1986, ‘How processes learn’, Distributed Computing 1, 40–52
Chellas, B. F., 1980, Modal Logic: An Introduction, Cambridge University Press, Cambridge.
Dabrowski, A., L. Moss, and R. Parikh, 1996, ‘Topological reasoning and the logic of knowledge’, Annals of Pure and Applied Logic 78, 73–110
Fischer Servi, G., 1980, ‘Semantics for a class of intuitionistic modal calculi’, In M. L. Dalla Chiara, editor, Italian Studies in the Philosophy of Science, 59–72, D. Reidel
Fischer Servi, G., 1984, ‘Axiomatizations for some intuitionistic modal logics’, Rend. Sem. Mat. Univers. Politecn. Torino 42, 179–194
Fitting, M. C., 1993, ‘Basic modal logic’, In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intellingence and Logic Programming, volume 1. Oxford University Press.
Gadamer, H. G., 1975, Truth and Method, Continuum, New York.
Georgatos, K., 1993, ‘Modal logics for topological spaces’, Ph.D. Dissertation. Ph.D. Program in Mathematics, City University of New York.
Georgatos, K., 1994, ‘Knowledge theoretic properties of topological spaces’, In M. Masuch and L. Pólos, editors, Knowledge Representation and Uncertainty, number 808 in Lecture Notes in Computer Science, 147–159, Springer-Verlag, Berlin, New York.
Georgatos, K., 1994, ‘Reasoning about knowledge on computation trees’, In C. MacNish, D. Pearce, and L. M. Pereira, editors, Logics in Artificial Intelligence (JELIA '94), number 838 in Lecture Notes in Computer Science, 300–315, Berlin, Springer-Verlag.
GIERZ, G., K. H. HOFFMAN, K. KEIMEL, J. D. LAWSON, M. W. MISLOVE, and D. S. SCOTT, 1980, A Compendium of Continuous Lattices, Springer-Verlag, Berlin, Heidelberg.
Goldblatt, R., 1987, Logics of Time and Computation, Number 7 in CSLI Lecture Notes. CSLI, Stanford.
Halpern, J. Y., and Y. Moses, 1984, ‘Knowledge and common knowledge in a distributed environment’, In Proceedings of the Third ACM Symposium on Principles of Distributed Computing, 50–61
Halpern, J. Y., and M. Y. Vardi, 1989, ‘The complexity of reasoning about knowledge and time. i. lower bounds’, Journal of Computer and System Sciences 38, 195–237
Hintikka, J., 1962, Knowledge and Belief, Cornell University Press, Ithaca, New York.
Hintikka, J., 1986, ‘Reasoning about knowledge in philosophy, the paradigm of epistemic logic’, In J. Y. Halpern, editor, Theoretical Aspects of Reasoning about Knowledge: Proceeding of the 1986 Conference, 63–80, Los Altos, Morgan Kaufmann.
Moss, L. S., and R. Parikh, 1992, ‘Topological reasoning and the logic of knowledge’, In Y. Moses, editor, Proceedings of the Fourth Conference (TARK 1992), 95–105
Parikh, R., and R. Ramanujam, 1985, ‘Distributed computing and the logic of knowledge’, In R. Parikh, editor, Logics of Programs, number 193 in Lecture Notes in Computer Science, 256–268, Berlin, New York, Springer-
Prior, A., 1967, Past, Present and Future, Oxford University Press, London.
Smyth, M. B., 1983, ‘Powerdomains and predicate transformers: a topological view’, In J. Diaz, editor, Automata, Languages and Programming, number 154 in Lecture Notes in Computer Science, 662–675, Berlin, Springer-Verlag.
Thomason, R. H., 1984, ‘Combinations of tense and modality’, In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume II, 135–165, D. Reidel Publishing Company.
Van Fraassen, B., 1981, ‘A temporal framework for conditionals and chance’, In W. Harper, R. Stalnaker, and G. Pearce, editors, Ifs: Conditionals, Belief, Decision, Chance, and Time, 323–340, D. Reidel, Dordrecht
Vickers, S., 1989, Topology via Logic, Cambridge Studies in Advanced Computer Science, Cambridge University Press, Cambridge.
Zanardo, A., 1985, ‘A finite axiomatization of the set of strongly valid ockhamist formulas’, Journal of Philosophical Logic 14, 447–468.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Georgatos, K. Knowledge on Treelike Spaces. Studia Logica 59, 271–301 (1997). https://doi.org/10.1023/A:1004908502255
Issue Date:
DOI: https://doi.org/10.1023/A:1004908502255