Knowledge on treelike spaces

Studia Logica

Volumn 59, Issue 2, 1997, Pages 271-301

  Georgatos, Konstantinos ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Bimodal logics; Branching time; Convexity; Logics of knowledge; Persistence

Indexed keywords

EID: 0005638369     PISSN: 00393215     EISSN: 15728730     Source Type: Journal    
DOI: 10.1023/A:1004908502255     Document Type: Article

References (24)

1. CHANDY, M., and J. MISRA, 1986, 'How processes learn', Distributed Computing 1, 40-52.
2. CHELLAS, B. F., 1980, Modal Logic: An Introduction, Cambridge University Press, Cambridge.
3. DABROWSKI, A., L. Moss, and R. PARIKH, 1996, "Topological reasoning and the logic of knowledge', Annals of Pure and Applied Logic 78, 73-110.
4. 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.
5. FISCHER SERVI, G., 1984, 'Axiomatizations for some intuitionistic modal logics', Rend. Sem. Mat. Univers. Politecn. Torino 42, 179-194.
6. FITTING, M. C., 1993, 'Basic modal logic', In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 1. Oxford University Press.
7. GADAMER, H. G., 1975, Truth and Method, Continuum, New York.
8. GEORGATOS, K., 1993, 'Modal logics for topological spaces', Ph.D. Dissertation. Ph.D. Program in Mathematics, City University of New York.
9. GEORGATOS, K., 1994, 'Knowledge theoretic properties of topological spaces', In M. Masuch and L. Polos, editors, Knowledge Representation and Uncertainty, number 808 in Lecture Notes in Computer Science, 147-159, Springer-Verlag, Berlin, New York.
10. 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.
11. GIERZ, G., K. H. HUFFMAN, K. KEIMEL, J. D. LAWSON, M. W. MISLOVE, and D.S. SCOTT, 1980, A Compendium of Continuous Lattices, Springer-Verlag, Berlin, Heidelberg.
12. GOLDBLATT, R., 1987, Logics of Time and Computation, Number 7 in CSLI Lecture Notes. CSLI, Stanford.
13. 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.
14. 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.
15. HINTIKKA, J., 1962, Knowledge and Belief, Cornell University Press, Ithaca, New York.
16. HlNTIKKA, J., 1986, 'Reasoning about knowledge in philosophy, the paradigm of epistemic logic', In J. Y. Halpern, editor, Theoretical Aspects of Reasoning about Knowledge: Proceedings of the 1986 Conference, 63-80, Los Altos, Morgan Kaufmann.
17. 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), 95105.
18. 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-Verlag.
19. PRIOR, A., 1967, Past, Present and Future, Oxford University Press, London.
20. 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.
21. 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.
22. VAN FRAASSEN, B., 1981, 'A temporal framework for conditionals and chance', In W. Harper, R. Stalnaker, and G. Pearce, editors, If a: Conditionals, Belief, Decision, Chance, and Time, 323-340. D. Reidel, Dordrecht.
23. VICKERS, S., 1989, Topology via Logic, Cambridge Studies in Advanced Computer Science, Cambridge University Press, Cambridge.
24. ZANARDO, A., 1985, 'A finite axiomatization of the set of strongly valid ockhamist formulas', Journal of Philosophical Logic 14, 447-468.