MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Computer Science and Artificial Intelligence Lab (CSAIL)
  • LCS Publications
  • LCS Technical Memos (1974 - 2003)
  • View Item
  • DSpace@MIT Home
  • Computer Science and Artificial Intelligence Lab (CSAIL)
  • LCS Publications
  • LCS Technical Memos (1974 - 2003)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Definability in Dynamic Logic

Author(s)
Meyer, Albert R.; Parikh, Rohit
Thumbnail
DownloadMIT-LCS-TM-156.pdf (2.995Mb)
Metadata
Show full item record
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.
Date issued
1980-02
URI
https://hdl.handle.net/1721.1/148983
Series/Report no.
MIT-LCS-TM-156

Collections
  • LCS Technical Memos (1974 - 2003)

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.