PDL with intersection of programs: a complete axiomatization
From MaRDI portal
Recommendations
- Iteration-free PDL with intersection: A complete axiomatization
- scientific article; zbMATH DE number 2066186
- PDL with intersection and converse: satisfiability and infinite-state model checking
- An axiomatization of PCTL*
- Axiomatization and computability of a variant of iteration-free PDL with fork
- Axiomatization and computability of a variant of iteration-free PDL with fork
- Computer Science Logic
- Iteration-free \(\mathrm{PDL}\) with storing, recovering and parallel composition: a complete axiomatization
- Complete logic programs with domain-closure axiom
- Automated Reasoning
Cites work
- A different approach to deontic logic: Deontic logic viewed as a variant of dynamic logic
- A model existence theorem in infinitary propositional modal logic
- A new proof of completeness for a relative modal logic with composition and intersection
- An essay in combinatory dynamic logic
- Axiomatising the logic of computer programming
- Axiomatizations with context rules of inference in modal logic
- Complete Axiomatization of a Relative Modal Logic with Composition and Intersection
- DAL -- a logic for data analysis
- Derivation rules as anti-axioms in modal logic
- scientific article; zbMATH DE number 4014675 (Why is no real title available?)
- scientific article; zbMATH DE number 1489632 (Why is no real title available?)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- Multi-dimensional modal logic
- PDL with data constants
- Propositional dynamic logic of regular programs
- Syntactic codes and grammar refinement
- The modal logic of inequality
Cited in
(10)- Towards reasoning about Petri nets: a propositional dynamic logic based approach
- On a graph calculus for modalities
- On a graph approach to modal logics
- Modal restriction semigroups: towards an algebra of functions.
- Propositional dynamic logic for Petri nets with iteration
- Modal logics for reasoning about infinite unions and intersections of binary relations
- A canonical model construction for iteration-free PDL with intersection
- Axiomatization and computability of a variant of iteration-free PDL with fork
- Resource separation in dynamic logic of propositional assignments
- Simple dynamic logic with parallel composition and applications to planning
This page was built for publication: PDL with intersection of programs: a complete axiomatization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3643256)
