Strong completeness and limited canonicity for PDL
type: Item
instance of: scholarly article
title: Strong completeness and limited canonicity for PDL
zbMATH Open document ID: 1159.03020
author: Rineke Verbrugge
author: Gerard R. Renardel de Lavalette
author: Barteld Kooi
published in: Journal of Logic, Language and Information
publication date: 2009-03-24T00:00:00Z
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 03B42
Mathematics Subject Classification ID: 03B45
zbMATH DE Number: 5532538
zbMATH Keywords: Propositional dynamic logic
zbMATH Keywords: Strong completeness
zbMATH Keywords: Canonical model
zbMATH Keywords: Model disharmony
MaRDI profile type: Publication
full work available at URL: s10849-007-9051-4
OpenAlex ID: W2141679935
cites work: Axiomatising the logic of computer programming
cites work: Q4495853
cites work: Q4343990
cites work: Q4525781
cites work: On models for propositional dynamic logic
cites work: Hybrid Logics with Infinitary Proof Systems
cites work: An elementary proof of the completeness of PDL
cites work: Q3947646
cites work: A model existence theorem in infinitary propositional modal logic
cites work: A proof of the completeness theorem of Grödel
cites work: Q5596237
cites work: Q3337453
cites work: Dynamic algebras which are not Kripke structures
DOI: 10.1007/S10849-007-9051-4
description: scientific article; zbMATH DE number 5532538