Deterministic propositional dynamic logic: finite models, complexity, and completeness (Q1839245): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0022-0000(82)90018-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1987019087 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Propositional dynamic logic of regular programs / 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: A near-optimal method for reasoning about action / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3871918 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decision complexity of variants of propositional dynamic logic / rank | |||
Normal rank |
Latest revision as of 17:47, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Deterministic propositional dynamic logic: finite models, complexity, and completeness |
scientific article |
Statements
Deterministic propositional dynamic logic: finite models, complexity, and completeness (English)
0 references
1982
0 references
modal operators
0 references
accessibility relations
0 references
deterministic propositional dynamic logic
0 references
atomic program
0 references
decision procedure
0 references
Segerberg's axioms for PDL
0 references
semantically complete
0 references