A representation theorem for models of *-free PDL-Reference-Cited by-同舟云学术

A representation theorem for models of *-free PDL

Published:1980 Issue: Volume: Page:351-362
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Kozen Dexter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-10003-2_83.pdf

Reference27 articles.

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.

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Epistemic Logics of Structured Intensional Groups;Electronic Proceedings in Theoretical Computer Science;2023-07-11

2. On the Complexity of Kleene Algebra with Domain;Relational and Algebraic Methods in Computer Science;2023

3. Algebraic Semantics for Dynamic Dynamic Logic;Logic, Rationality, and Interaction;2015

4. Semigroup actions on posets and preimage quasi-orders;Semigroup Forum;2012-10-05

5. Subdirectly irreducible separable dynamic algebras;Mathematical Logic Quarterly;2010-07-12