Deterministic propositional dynamic logic: finite models, complexity, and completeness
type: Item
instance of: scholarly article
title: Deterministic propositional dynamic logic: finite models, complexity, and completeness
zbMATH Open document ID: 0512.03013
DOI: 10.1016/0022-0000(82)90018-6
author: Mordechai Ben-Ari
author: Joseph Y. Halpern
author: Amir Pnueli
published in: Journal of Computer and System Sciences
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 68Q65
zbMATH DE Number: 3807590
zbMATH Keywords: modal operators
zbMATH Keywords: accessibility relations
zbMATH Keywords: deterministic propositional dynamic logic
zbMATH Keywords: atomic program
zbMATH Keywords: decision procedure
zbMATH Keywords: Segerberg's axioms for PDL
zbMATH Keywords: semantically complete
MaRDI profile type: Publication
full work available at URL: 0022-0000(82)90018-6
OpenAlex ID: W1987019087
cites work: Propositional dynamic logic of regular programs
cites work: An elementary proof of the completeness of PDL
cites work: A near-optimal method for reasoning about action
cites work: Q3871918
cites work: Decision complexity of variants of propositional dynamic logic
description: scientific article; zbMATH DE number 3807590