Definability in Dynamic Logic
| dc.contributor.author | Meyer, Albert R. | en_US |
| dc.contributor.author | Parikh, Rohit | en_US |
| dc.date.accessioned | 2023-03-29T14:15:55Z | |
| dc.date.available | 2023-03-29T14:15:55Z | |
| dc.date.issued | 1980-02 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/148983 | |
| dc.description.abstract | We study the expressive power of various versions of Dynamic Logic and compare them with each other as well as with standard languages in the logical literature. One version of Dynamic Logic is equivalent to the infinitary logic L CK ω1,ω, but regular Dynamic Logic is strictly less expressive. In particular, the ordinals ω^ω and ω^ω*2 are indistinguishable by formulas of regular Dynamic Logic. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-156 | |
| dc.title | Definability in Dynamic Logic | en_US |
| dc.identifier.oclc | 6681577 |
