Iteration-free PDL with intersection : a complete axiomatization

• Autorzy: Balbiani P. , Vakarelov D.
• Języki publikacji: EN

Abstrakty

EN

This paper is devoted to the completeness issue of PDL0Ç - an iteration-free fragment of Propositional Dynamic Logic with intersection of programs. The trouble with PDL0Ç is that the operation of intersection is not modally definable. Using new techniques connected with rules for intersection and the notions of large and maximal programs, the paper demonstrates that the presented proof theory for PDL0Ç is complete for the standard Kripke semantics of PDL0Ç.

Słowa kluczowe

EN

PDL with intersection; modal rules for intesection; maximal programs

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2001
• Tom: Vol. 45, nr 3
• Strony: 173--194
• Opis fizyczny: bibliogr. 27 poz.

Twórcy

autor

Balbiani P.

autor

Vakarelov D.

• Institut de recherche en informatique de Tuluse, 118 rute de Narbonne, 31062 Toulouse Cedex 4, France,