M. Reynolds. An Axiomatization of Full Computation Tree Logic. J. Symbolic Logic, 66:1011--1057, 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Temporal Logics of Computations - Introductory Course - Goranko (2000) (Correct)
....similar to the proof for PDL in [KT90] While there are completeness results (see [Sti92] for CTL # with respect to the generalized semantics introduced above, until recently no finitary complete axiomatization of CTL # with respect to the standard semantics was known. M. Reynolds announced in [Rey98] such an axiomatization using a rather complex additional rule in the style of Gabbay s irreflexivity rule, the idea of which is based the relation between CTL # and Muller automata, used in the proof of completeness. In a very recent draft [Rey00] he announced that such a rule can be omitted if ....
M. Reynolds. An axiomatization of full computation tree logic. submitted, 1998.
Program Logics: theory and applications - Shilov (Correct)
....methodology of program logics 12 : D.Harel, J.Halpern, L.Lamport, Z.Manna, R.Parikh, J. Tiuryn, M.Vardi, etc. I would like to remark also, that the most recent achievement in theory of program logics is a sound and complete axiomatization for full branching time temporal logic CTL by M Reynolds [25]. 12 it is not a complete list and, of course, it represent a personal viewpoint 22 4.4 Program Logics: Russian Chapter In this talk I did not mention till now any paper or research on program logics which was done in Soviet Union and in Russia 13 . It can mislead to an opinion that ....
Reynolds M. An axiomatization of full computation tree logic. To appear in Journal of Symbolic Logic, 2001 (a draft is available at URL http://www.it.murdoch.edu.au/mark/research/online).
Comparing Tableaux, Automata and Games for Modal and Temporal.. - Lange (2001) (Correct)
....it is claimed that no tableau like method works for checking satisfiability of a CTL # formula [ES84] because it requires determinisation which is not a problem when using automatatheoretic techniques. This explains why the completeness of CTL # has been an open problem for a long time [Rey00]. 4 Games Similar to the idea of Ehrenfeucht Frasse games [Tho93] two abstract players are given complementary tasks, e.g. to show that a formula is or is not satisfiable. Games are a very intuitive notion for logics since the constructs of a logic can usually be partitioned into existential ....
M. Reynolds. An axiomatization of full computation tree logic. Journal of Symbolic Logic, 2000. to appear.
Satisfiability and Completeness of PDL replayed - Lange, Stirling (2001) (1 citation) (Correct)
....strategies for one of the players. It remains to see whether the focus game technique is robust enough to construct complete axiom systems for further logics, in particular propositional dynamic logic with converse, CPDL (cf. 3] or to provide simpler proofs of the completeness of CTL # (cf. [10]) and the modal calculus (cf. 15] 2 Syntax and Semantics Let Prog = a, b, be a set of atomic programs and Prop be a set of propositional constants including true and false. We assume Prop to be closed under complementary propositions, i.e. Prop = tt, ff, q 1 , q 1 , ....
M. Reynolds. An axiomatization of full computation tree logic. Journal of Symbolic Logic, 2000. to appear.
A Sound and Complete Proof System for QPTL - French, Reynolds Self-citation (Reynolds) (Correct)
No context found.
M. Reynolds. An axiomatization of full computation tree logic. J. Symbolic Logic, 63(3):1011-1057, 2001.
Non-deterministic temporal logics for general Flow systems - Davoren, Coulthard.. (2004) (Correct)
No context found.
M. Reynolds. An Axiomatization of Full Computation Tree Logic. J. Symbolic Logic, 66:1011--1057, 2001.
TEMPORAL LOGICS OF COMPUTATIONS - Introductory course - Goranko (2000) (Correct)
No context found.
M. Reynolds. An axiomatization of full computation tree logic. submitted, 1998.
Satisfiability Games for CTL* - Lange, Stirling (Correct)
No context found.
M. Reynolds. An axiomatization of full computation tree logic. Journal of Symbolic Logic, 2000. to appear.
An Axiomatization of Prior's Ockhamist Logic of Historical.. - Reynolds (2003) (Correct)
No context found.
M. Reynolds. An axiomatization of full computation tree logic. J. of Symbolic Logic, 66(3):1011-1057, 2001.
Complete Axiomatizations for Reasoning about Knowledge and .. - van der Meyden, Wong (2003) (Correct)
No context found.
M. Reynolds. An axiomatization of full computation tree logic. Journal of Symbolic Logic, 66(3):1011--1057, Sept 2001.
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