G. Mirkowska. PAL --- Propositional algorithmic logic. In E. Engeler, editor, Logic of Programs, volume 125 of Lecture Notes in Computer Science, pages 23 -- 101. Springer-Verlag, Berlin, Heidelberg, New York, 1981. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Dynamic Logic - Harel, Kozen, Tiuryn (1984) (356 citations) (Correct)
....1977] The original version of AL allowed deterministic while programs and formulas built from the constructs [ n2 ; respectively, where is a deterministic while program and is a quantifier free first order formula. In [Mirkowska, 1980; Mirkowska, 1981a; Mirkowska, 1981b] AL was extended to allow nondeterministic while programs and the constructs r halt( respectively. The latter asserts that all traces of are finite and terminate in a state satisfying . A feature present in AL but not in DL is the set of dynamic terms in ....
....with the data structure stack. One can then investigate the consequences of such axioms within AL, regarding them as properties of the corresponding data structures. Complete infinitary deductive systems for first order and propositional versions are given in [Mirkowska, 1980; Mirkowska, 1981a; Mirkowska, 1981b] The infinitary completeness results for AL are usually proved by the algebraic methods of [Rasiowa and Sikorski, 1963] Constable, 1977] Constable and O Donnell, 1978] and [Goldblatt, 1982] present logics similar to AL and DL for reasoning about deterministic while programs. 13.2 ....
[Article contains additional citation context not shown here]
G. Mirkowska. PAL---propositional algorithmic logic. Fund. Informaticae, IV:675--760, 1981.
Dynamic Logic - Harel, Kozen, Tiuryn (1984) (356 citations) (Correct)
....1977] and [Salwicki, 1977] The original version of AL allowed deterministic while programs and formulas built from the constructs [ n2 ; respectively, where is a deterministic while program and is a quantifier free first order formula. In [Mirkowska, 1980; Mirkowska, 1981a; Mirkowska, 1981b] AL was extended to allow nondeterministic while programs and the constructs r halt( respectively. The latter asserts that all traces of are finite and terminate in a state satisfying . A feature present in AL but not in DL is the set of ....
....an axiom connected with the data structure stack. One can then investigate the consequences of such axioms within AL, regarding them as properties of the corresponding data structures. Complete infinitary deductive systems for first order and propositional versions are given in [Mirkowska, 1980; Mirkowska, 1981a; Mirkowska, 1981b] The infinitary completeness results for AL are usually proved by the algebraic methods of [Rasiowa and Sikorski, 1963] Constable, 1977] Constable and O Donnell, 1978] and [Goldblatt, 1982] present logics similar to AL and DL for reasoning about deterministic while ....
[Article contains additional citation context not shown here]
G. Mirkowska. PAL---propositional algorithmic logic. In E. Engeler, editor, Proc. Workshop Logic of Programs, volume 125 of Lect. Notes in Comput. Sci., pages 23--101. Springer-Verlag, 1981.
On Axiomatizations for Propositional Logics of Programs - Knijnenburg (1988) (1 citation) (Correct)
....Floyd were developed further by many authors and the logic of partial correctness, also called Floyd Hoare logic, has been studied intensively. In 1969 Salwicki [31] formulated the algorithmic logic AL, following the work of Engeler. AL was developed further by a group in Warsaw. Later, Mirkowska [19] gave a propositional version of AL. In 1976, Pratt [25] introduced Modal Logic to computer science, which proved to be very fruitful. Fisher and Ladner [6] gave the definition of Propositional Dynamic Logic, following Pratt, and proved decidability of the logic by means of a filtration technique, ....
....In chapter 5, we describe a fragment of Propositional Dynamic Logic of Context Free Programs. We give an axiomatization and prove it complete using the technique of chapter 6 2. In chapter 6, some related topics are discussed. We review Propositional Algorithmic Logic as formulated by Mirkowska [19] and compare the proof of completeness from that paper with ours. Finally, we discuss two different approaches to the problem of introducing time in the logic, namely, the linear time and the branching time approach. Acknowledgements The author wishes to thank Jan van Leeuwen for introduction to ....
[Article contains additional citation context not shown here]
Mirkowska, G.,"PAL --- Propositional Algorithmic Logic", in: E. Engeler (ed.), Proc. Workshop on Logic of Programs, LNCS 125, SpringerVerlag, Berlin etc., 1981, 23--102.
A New Proof of Completeness for a Relative Modal Logic With.. - Balbiani (Correct)
....of which depend on parameters. Among the well known relative modal logics devised in artificial intelligence and computer science, there are PDL the propositional dynamic logic introduced by Fischer and Ladner [6] PAL the propositional algorithmic logic set out by Mirkowska [12], DAL the logic for data analysis expounded by Fari nas del Cerro and Or lowska [5] and BML the Boolean modal logic brought in by Gargov and Passy [7] Philippe Balbiani, balbiani lipn.univ paris13.fr, Laboratoire d informatique de ParisNord, Institut Galil ee, Universit e ....
G. Mirkowska. PAL --- propositional algorithmic logic. Fundamenta Informaticae, Volume 4, 675--760, 1981.
Strong Completeness and Limited Canonicity for - And Similar Modal (2004) (Correct)
No context found.
G. Mirkowska. PAL --- Propositional algorithmic logic. In E. Engeler, editor, Logic of Programs, volume 125 of Lecture Notes in Computer Science, pages 23 -- 101. Springer-Verlag, Berlin, Heidelberg, New York, 1981.
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