Definability and computability for PRSPDL

Philippe Balbiani (1, 2) , Tinko Tinchev (3)

1 IRIT-LILaC - Logique, Interaction, Langue et Calcul
2 CNRS - Centre National de la Recherche Scientifique
3 Sofia University "St. Kliment Ohridski"

PRSPDL is a variant of PDL with parallel composition. In the Kripke models in which PRSPDL-formulas are evaluated, states have an internal structure. We devote this paper to the definability issue of several classes of frames by means of the language of PRSPDL and to the computability issue of PRSPDL-validity for various fragments of the PRSPDL-language and for various classes of PRSPDL-frames.

Mots clés: Modal logic; Dynamic logic; Definability; Computability

Domaines: Logique en informatique [cs.LO]

Philippe Balbiani, Tinko Tinchev. Definability and computability for PRSPDL. 10th conference on Advances in Modal logic (AiML 2014), Aug 2014, Groningen, Netherlands. pp.16-33. ⟨hal-01650181⟩