Abstract
A family of propositional logics of programs with Kripke-style semantics is introduced. A global deductive system is given and the completeness of the logics from that family is proved.
Keywords
Get full access to this article
View all access options for this article.