Deterministic dynamic logic is strictly weaker than dynamic logic
type: Item
instance of: scholarly article
title: Deterministic dynamic logic is strictly weaker than dynamic logic
zbMATH Open document ID: 0537.68037
DOI: 10.1016/S0019-9958(83)80024-2
published in: Information and Control
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 03B45
zbMATH DE Number: 3854410
zbMATH Keywords: expressive power
zbMATH Keywords: deterministic dynamic logic
author: Alexei P. Stolboushkin
author: Michael A. Taitslin
MaRDI profile type: MaRDI publication profile
full work available at URL: s0019-9958(83)80024-2
OpenAlex ID: W1984464989
Recommended article: Q3334975
Recommended article: The comparison of the expressive power of first-order dynamic logics
Recommended article: A simplified proof of \(DDL<DL\)
Recommended article: A nondeterministic program logic
Recommended article: The propositional dynamic logic of deterministic, well-structured programs
description: scientific article; zbMATH DE number 3854410