P.M.W. Knijnenburg  Home/Search
Context Related
| wi.leidenuniv.nl/~peterk/pdl.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wi.leidenuniv.nl/~peterk/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, we focus attention on a propositional program logic, namely Propositional Dynamic Logic or PDL in short. (Update)
Context of citations to this paper: More
.... derivability of formulae of the form [ff ]OE is closely related, as the following theorem shows; a proof of the theorem can be found in [7]. 20 Theorem 5.3 1. In the infinitary system AX1 , the induction axiom is derivable. 2. In the Segerberg system AX, ff ] OE [ff]OE)...
.... Dynamic Logic [Apt and Olderog, 1991; Backhouse, 1986; Harel, 1979; Harel, 1984; Parikh, 1981; Goldblatt, 1982; Goldblatt, 1987; Knijnenburg, 1988; Cousot, 1990; Emerson, 1990; Kozen and Tiuryn, 1990] In particular, much of this chapter is an abbreviated summary of material...
Cited by: More
Dynamic Logic - Harel, Kozen, Tiuryn (1984) (Correct)
On Models for Propositional Dynamic Logic - Knijnenburg, van Leeuwen (1991) (Correct)
Similar documents (at the sentence level):
33.6%: On Axiomatizations for Propositional Logics of Programs - Knijnenburg (1988) (Correct)
Active bibliography (related documents): More All
0.5: Compositionality - Janssen (1997) (Correct)
0.3: Dynamic Algebras: Examples, Constructions, Applications - Pratt (Correct)
0.3: Propositional Dynamic Logic of Nonregular Programs - Harel, Pnueli, Stavi (1983) (Correct)
Similar documents based on text: More All
0.3: Process Logic: Expressiveness, Decidability, Completeness - Harel, Kozen, Parikh (1982) (Correct)
0.1: Equational Axioms of Test Algebra - Hollenberg (1996) (Correct)
0.1: Behavioural Theories - Bidoit, Hennicker (1995) (Correct)
Related documents from co-citation: More All
2: Relation Algebras with Transitive Closure (context) - Ng - 1984
2: PAL --- propositional algorithmic logic (context) - Mirkowska - 1981
2: Semantical considerations on Floyd-Hoare logic - Pratt - 1976
BibTeX entry: (Update)
Knijnenburg, P.M.W., "On Axiomatizations for Propositional Logics of Programs", Tech. Rep. RUU-CS-88-34, Univ. of Utrecht. http://citeseer.ist.psu.edu/article/knijnenburg88axiomatizations.html More
@techreport{ knijnenburg88axiomatizations,
author = "P. M. W. Knijnenburg",
title = "On Axiomatizations for Propositional Logics of Programs",
address = "Utrecht",
year = "1988",
url = "citeseer.ist.psu.edu/article/knijnenburg88axiomatizations.html" }
Citations (may not include all citations):539 The Temporal Logic of Programs (context) - Pnueli - 1976 ACM DBLP
362 Dynamic Logic - Harel - 1984 ACM
223 Assigning Meanings to Programs (context) - Floyd - 1967
195 Propositional Dynamic Logic of Regular Programs (context) - Fischer, Ladner - 1979 DBLP
143 Logics of Programs (context) - Kozen, Tiuryn
126 Semantical Considerations on Floyd-Hoare Logic - Pratt - 1976 ACM DBLP
122 Applications of Temporal Logic to the Specification and Veri.. (context) - Pnueli - 1985 ACM DBLP
114 Logics of Time and Computation (context) - Goldblatt - 1987 ACM
85 First Order Dynamic Logic (context) - Harel - 1979
63 The Temporal Logic of Branching Time (context) - Ben-Ari, Pnueli et al. - 1983 ACM DBLP
59 Models of Program Logics (context) - Pratt - 1979 DBLP
53 Sometime' and `Not Never' Revisited: On Branching versus Lin.. (context) - Emerson, Halpern - 1986
34 Concurrent Dynamic Logic (context) - Peleg - 1987 ACM DBLP
31 An Elementary Proof of the Completeness of PDL (context) - Kozen, Parikh - 1981
29 The Mathematics of Metamathematics (context) - Rasiowa, Sirkorski - 1963
22 Model Theory for Infinitary Logic (context) - Keisler - 1971
22 Process Logic (context) - Pratt - 1979 ACM DBLP
18 Models and Ultraproducts (context) - Bell, Slomson - 1979
15 Propositional Dynamic Logic of Programs: A Survey (context) - Parikh - 1981
14 Sometime' is Sometimes `Not Never (context) - Lamport - 1980
11 Dynamic Algebras and the Nature of Induction (context) - Pratt - 1980 ACM DBLP
9 Descriptively Complete Process Logic (context) - Nishimura - 1980 DBLP
5 PAL --- Propositional Algorithmic Logic (context) - Mirkowska - 1981
5 Formalized Algorithmic Languages (context) - Salwicki - 1970
4 A Completeness Technique for D-Axiomatizable Semantics (context) - Berman - 1979 ACM DBLP
4 Propositional Dynamic Logic of Context--Free Programs (context) - Harel, Pnueli et al. - 1981
4 Propositional Dynamic Logic of Looping and Converse Is Eleme.. (context) - Street - 1982
4 Algorithmic Properties of Structures (context) - Engeler - 1967
3 Further Results on Propositional Dynamic Logic of Non--regul.. (context) - Harel, Pnueli et al. - 1981
2 On Induction vs. ?--Continuity (context) - Kozen - 1981
2 A Completeness Theorem in the Modal Logic of Programs (Preli.. (context) - Segerberg - 1979
2 Dynamic Logic (context) - Pratt - 1982 ACM
2 A Combined Proof of one-exponentional Decidability and Compl.. (context) - Sherman, Harel - 1982
2 A Representation Theorem for Models of ?--Free PDL (context) - Kozen - 1982
Documents on the same site (http://www.wi.leidenuniv.nl/~peterk/): More
On Reducing Overhead in Loops - Knijnenburg, Bik (1996) (Correct)
Flattening VLIW code generation for imperfectly nested loops - Knijnenburg (1998) (Correct)
The Automatic Generation of Sparse Primitives - Bik, Brinkhaus, Knijnenburg.. (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC