PDL with data constants (Q1065545): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Hirokazu Nishimura / rank | |||
Property / reviewed by | |||
Property / reviewed by: Hirokazu Nishimura / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(85)90127-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2036328670 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Propositional dynamic logic of regular programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: First-order dynamic logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3313253 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An elementary proof of the completeness of PDL / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3919070 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3922159 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5596237 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5551146 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3322087 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5734410 / rank | |||
Normal rank |
Latest revision as of 19:24, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | PDL with data constants |
scientific article |
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