scientific article; zbMATH DE number 7439735
From MaRDI portal
Publication:5015273
zbMath1478.03036arXiv1609.04093MaRDI QIDQ5015273
Martin Lange, Daniel Kernberger, Florian Bruse
Publication date: 7 December 2021
Full work available at URL: https://arxiv.org/abs/1609.04093
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05)
Cites Work
- An essay in combinatory dynamic logic
- A near-optimal method for reasoning about action
- An elementary proof of the completeness of PDL
- Propositional dynamic logic is weaker without tests
- Propositional dynamic logic of regular programs
- Reasoning about action and change. A dynamic logic approach
- PDL with intersection of programs: a complete axiomatization
- Propositional dynamic logic of looping and converse is elementarily decidable
- Complete Axiomatization of a Relative Modal Logic with Composition and Intersection
- 2-Exp Time lower bounds for propositional dynamic logics with intersection
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
