A representation theorem for models of *-free PDL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 85 LNCS, Issue , 1980, Pages 351-362

  Kozen, Dexter ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; AUTOMATA THEORY; FORMAL LOGIC;

ALGEBRAIC CONDITIONS; ALGEBRAIC INTERPRETATIONS; FREE DYNAMICS; KRIPKE MODEL; PROPOSITIONAL DYNAMIC LOGIC; REPRESENTATION THEOREM; STANDARD INTERPRETATION; STONE SPACES;

BOOLEAN ALGEBRA;

EID: 85035027843     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-10003-2_83     Document Type: Conference Paper

References (27)

1. Aho A. V., J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. Banachowski, L., A. Kreczmar, G. Mirkowska, H. Rasiowa, and A. Salwicki, “An introduction to Algorithmic Logic,” in: Mazurkiewicz and Pawlak, eds., Math. Found. of Comp. Sci., Banach Center Publications, Warsaw, 1977.
3. Berman, F., “A completeness technique for D-axiomatizable semantics,” Proc. 11th ACM Symp. on Theory of Comp. (May 1979), 160–166.
4. Bell, J. S. and A. B. Slomson, Models and Ultraproducts. North Holland, Amsterdam, 1971.
5. Conway, J. H. Regular Algebra and Finite Machines. Chapman-Hall, London, 1971.
6. Constable, R. L. and M. J. O’Donnell. A Programming Logic. Winthrop, Cambridge, Mass., 1978.
7. Everett, C. J. and S. Ulam, “Projective algebra I,” Amer. J. Math. 68:1 (1946), 77–88.
8. Fischer, M. J. and R. E. Ladner, “Propositional dynamic logic of regular programs,” J. Comput. Syst. Sci. 18:2 (1979).
9. Gabbay, D., “Axiomatizations of logics of programs,” manuscript, Nov. 1977.
10. Harel, D. First-Order Dynamic Logic. Lecture Notes in Computer Science 68, ed. Goos and Hartmanis, Springer-Verlag, Berlin, 1979.
11. Jonsson, B. and A. Tarski, “Representation problems for relation algebras,” abstract 89t, Bull. Amer. Math. Soc. 54 (1948), 80.
12. Kozen, D., “A representation theorem for models of *-free PDL,” Report RC7864, IBM Research, Yorktown Heights, New York, Sept. 1979.
13. Kozen, D., “On the duality of dynamic algebras and Kripke models,” Report RC7893, IBM Research, Yorktown Heights, New York, Oct. 1979.
14. Kozen, D., “On the representation of dynamic algebras,” Report RC7898, IBM Research, Yorktown Heights, New York, Oct. 1979.
15. Lyndon, R. C., “The representation of relation algebras,” Ann. Math. 51:3 (1950), 707–729.
16. McKinsey, J. C. C., “Postulates for the calculus of binary relations,” J. Sym. Logic 5:3 (1940), 85–97.
17. McKinsey, J. C. C., “On the representation of projective algebras,” Amer. J. Math. 70 (1948), 375–384.
18. Nishimura, H., “Sequential Method in Propositional Dynamic Logic,” Acta Informatica 12 (1979), 377–400.
19. Parikh, R., “A completeness result for PDL,” Symp. on Math. Found. of Comp. Sci., Zakopane, Warsaw, Springer-Verlag, May 1978.
20. Pratt, V. R., “Semantical considerations on Floyd-Hoare logic,” Proc. 17th IEEE Symp. on Foundations of Comp. Sci. (Oct. 1976), 109–121.
21. Pratt, V. R., “A practical decision method for Propositional Dynamic Logic,” Proc. 10th ACM Symp. on Theory of Computing (May 1978), 326–337.
22. Pratt, V. R., “Models of program logics,” Proc. 20th IEEE Symp. on Foundations of Comp. Sci. (Oct. 1979), to appear.
23. Pratt, V. R., “Dynamic algebras: Examples, constructions, applications,” manuscript, July 1979.
24. Segerberg, K., “A completeness theorem in the modal logic of programs,” Not. AMS 24:6 (1977), A-552.
25. Salomaa, A. and M. Soittala. Automata Theoretic Aspects of Formal Power Series. Springer-Verlag, New York, 1978.
26. Tarski, A., “On the calculus of relations,” J. Symb. Logic 6:3 (1941), 73–89.
27. van Emde Boas, “The connection between modal logic and algorithmic logics,” report 78-02, Univ. of Amsterdam, May 1978.