PDL with intersection of programs: a complete axiomatization-Reference-Cited by-同舟云学术

PDL with intersection of programs: a complete axiomatization

Published:2003-01 Issue:3-4 Volume:13 Page:231-276
ISSN:1166-3081
Container-title:Journal of Applied Non-Classical Logics
language:en
Short-container-title:Journal of Applied Non-Classical Logics

Author:

Balbiani Philippe¹,Vakarelov Dimiter²

Affiliation:

1. a Institut de recherche en informatique de Toulouse , Université Paul Sabatier , 118 route de Narbonne, 31062 , Toulouse cedex 4, France

2. b Department of Mathematical Logic with Laboratory for Applied Logic, Faculty of Mathematics and Computer Science , Sofia University , blvd James Bouchier 5, 1126 , Sofia , Bulgaria

Publisher

Informa UK Limited

Subject

Logic,Philosophy

Link

https://www.tandfonline.com/doi/pdf/10.3166/jancl.13.231-276

Reference33 articles.

1. A new proof of completeness for a relative modal logic with composition and intersection

2. Complete Axiomatization of a Relative Modal Logic with Composition and Intersection

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Resource separation in dynamic logic of propositional assignments;Journal of Logical and Algebraic Methods in Programming;2021-06

2. Resource Separation in Dynamic Logic of Propositional Assignments;Lecture Notes in Computer Science;2020

3. Simpler Completeness Proofs for Modal Logics with Intersection;Lecture Notes in Computer Science;2020

4. Axiomatization and computability of a variant of iteration-free PDL with fork;Journal of Logical and Algebraic Methods in Programming;2019-11

5. A Non-wellfounded, Labelled Proof System for Propositional Dynamic Logic;Lecture Notes in Computer Science;2019