Propositional dynamic logic with local assignments (Q1062972): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(85)90031-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087363667 / rank | |||
Normal rank | |||
Revision as of 23:19, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Propositional dynamic logic with local assignments |
scientific article |
Statements
Propositional dynamic logic with local assignments (English)
0 references
1985
0 references
An extension of propositional dynamic logic is proposed which allows a new kind of program terms - local assignments \(p:=v\) of truth-values v to propositional variables p. In this logic many notions, like equivalence of programs, looping and finitely branching, as well as the truth in the (standard model of) first order arithmetic are expressible. In fact it is equivalent in expressive power to first-order logic with transitive closure and its validity problem is \(\Pi^ 1_ 1\)-complete.
0 references
extension of propositional dynamic logic
0 references
equivalence of programs
0 references
looping
0 references
finitely branching
0 references
first order arithmetic
0 references
first-order logic with transitive closure
0 references
