Notes on the Propositional |-calculus: Completeness and Related Results

[1]  Igor Walukiewicz,et al.  Automata for the-calculus and Related Results , 1995 .

[2]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[3]  D. Basin.  Induction Based on Rippling and Proof Planning Mini-Course , 1994 .

[4]  Damian Niwinski,et al.  Fixed points vs. infinite generation , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[5]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[6]  Charles Rackoff,et al.  The Emptiness Problem for Automata on Infinite Trees , 1972, SWAT.

[7]  Orna Grumberg,et al.  Branching Time Temporal Logic and Amorphous Tree Automata , 1993, CONCUR.

[8]  David Walker,et al.  Local Model Checking in the Modal mu-Calculus , 1991, Theor. Comput. Sci..

[9]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[10]  Robert McNaughton,et al.  Testing and Generating Infinite Sequences by a Finite Automaton , 1966, Inf. Control..

[11]  A. Prasad Sistla,et al.  On Model-Checking for Fragments of µ-Calculus , 1993, CAV.

[12]  E. Allen Emerson,et al.  The complexity of tree automata and logics of programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.