PDL with intersection of programs: a complete axiomatization

&
Journal of Applied Non-Classical Logics 13 (3-4):231-276 (2003)
  Copy   BIBTEX

Abstract

One of the important extensions of PDL is PDL with intersection of programs. We devote this paper to its complete axiomatization.

Categories

Keywords

Reprint years

DOI

10.3166/jancl.13.231-276

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Complete Axiomatization of a Relative Modal Logic with Composition and Intersection.Philippe Balbiani & Luis Fariñas del Cerro - 1998 - Journal of Applied Non-Classical Logics 8 (4):325-335.
Complete Axiomatization of a Relative Modal Logic with Composition and Intersection.Philippe Balbiani & Luis Fariñas del Cerro - 1998 - Journal of Applied Non-Classical Logics 8 (4):325-335.
Alternative axiomatics and complexity of deliberative stit theories.Philippe Balbiani, Andreas Herzig & Nicolas Troquard - 2008 - Journal of Philosophical Logic 37 (4):387 - 406.
An axiomatization for until and since over the reals without the IRR rule.Mark Reynolds - 1992 - Studia Logica 51 (2):165 - 193.
Independently axiomatizable ℒω1,ω theories.Greg Hjorth & Ioannis A. Souldatos - 2009 - Journal of Symbolic Logic 74 (4):1273-1286.
A sound and complete axiomatization for Dynamic Topological Logic.David Fernández-Duque - 2012 - Journal of Symbolic Logic 77 (3):947-969.
Independently Axiomatizable [image] Theories.Greg Hjorth & Ioannis A. Souldatos - 2009 - Journal of Symbolic Logic 74 (4):1273 - 1286.
A tableau method for graded intersections of modalities: A case for concept languages. [REVIEW]Ani Nenkova - 2002 - Journal of Logic, Language and Information 11 (1):67-77.
On logic of complex algorithms.Helena Rasiowa - 1981 - Studia Logica 40 (3):289 - 310.
First-order theories for pure Prolog programs with negation.Robert F. Stärk - 1995 - Archive for Mathematical Logic 34 (2):113-144.
Every functionally complete $m$-valued logic has a Post-complete axiomatization.Nuel D. Belnap & Storrs McCall - 1970 - Notre Dame Journal of Formal Logic 11 (1):106-106.
Rationally Functional Dependence.Pavel Naumov & Brittany Nicholls - 2014 - Journal of Philosophical Logic 43 (2-3):603-616.
2-Exp Time lower bounds for propositional dynamic logics with intersection.Martin Lange & Carsten Lutz - 2005 - Journal of Symbolic Logic 70 (4):1072-1086.
Independence in Information Spaces.Pavel Naumov - 2012 - Studia Logica 100 (5):953-973.

Analytics

Added to PP
2014-01-21

Downloads
29 (#538,668)

6 months
2 (#1,240,909)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Definability and Computability for PRSPDL.Philippe Balbiani & Tinko Tinchev - 2014 - In Rajeev Goré, Barteld Kooi & Agi Kurucz (eds.), Advances in Modal Logic, Volume 10. CSLI Publications. pp. 16-33.
Propositional dynamic logic for Petri nets.B. Lopes, M. Benevides & E. H. Haeusler - 2014 - Logic Journal of the IGPL 22 (5):721-736.

Add more citations

References found in this work

A companion to modal logic.G. E. Hughes - 1984 - New York: Methuen. Edited by M. J. Cresswell.
Mathematics of Modality.Robert Goldblatt - 1993 - Center for the Study of Language and Information Publications.
Multi-dimensional modal logic.Maarten Marx - 1997 - Boston, Mass.: Kluwer Academic Publishers. Edited by Yde Venema.

View all 16 references / Add more references