PDL with data constants (Q1065545)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3924131
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PDL with data constants |
scientific article; zbMATH DE number 3924131 |
Statements
PDL with data constants (English)
0 references
1985
0 references
This paper considers an extension of classical propositional dynamic logic with new operators for programs such as \(\alpha\) \(\cap \beta\) (the intersection of the programs \(\alpha\) and \(\beta)\) and \({\bar \alpha}\) (the complement of the program \(\alpha)\) and new formulas such as \(\alpha\) \(\subset \beta\) and \(\alpha =\beta\), which is given an (infinitary) complete axiomatization and shown to be highly undecidable.
0 references
dynamic algebra
0 references
data identity
0 references
undecidability
0 references
verification of
0 references
programs
0 references
propositional dynamic logic
0 references
intersection
0 references
complement
0 references
complete axiomatization
0 references
0.8299378156661987
0 references
0.823544979095459
0 references
0.822124183177948
0 references
0.8216328024864197
0 references
