Dynamic logic / (Record no. 73054)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03281nam a2200505 i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 6267400 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20220712204654.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 151223s2000 maua ob 001 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9780262274951 |
| -- | ebook |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| -- | electronic |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| -- | |
| 100 1# - AUTHOR NAME | |
| Author | Harel, David, |
| 245 10 - TITLE STATEMENT | |
| Title | Dynamic logic / |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | 1 PDF (xv, 459 pages) : |
| 490 1# - SERIES STATEMENT | |
| Series statement | Foundations of computing. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | Among the many approaches to formal reasoning about programs, Dynamic Logic enjoys the singular advantage of being strongly related to classical logic. Its variants constitute natural generalizations and extensions of classical formalisms. For example, Propositional Dynamic Logic (PDL) can be described as a blend of three complementary classical ingredients: propositional calculus, modal logic, and the algebra of regular events. In First-Order Dynamic Logic (DL), the propositional calculus is replaced by classical first-order predicate calculus. Dynamic Logic is a system of remarkable unity that is theoretically rich as well as of practical value. It can be used for formalizing correctness specifications and proving rigorously that those specifications are met by a particular program. Other uses include determining the equivalence of programs, comparing the expressive power of various programming constructs, and synthesizing programs from specifications.This book provides the first comprehensive introduction to Dynamic Logic. It is divided into three parts. The first part reviews the appropriate fundamental concepts of logic and computability theory and can stand alone as an introduction to these topics. The second part discusses PDL and its variants, and the third part discusses DL and its variants. Examples are provided throughout, and exercises and a short historical section are included at the end of each chapter. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Kozen, Dexter, |
| 700 1# - AUTHOR 2 | |
| Author 2 | Tiuryn, Jerzy. |
| 856 42 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | https://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267400 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cambridge, Massachusetts : |
| -- | MIT Press, |
| -- | 2000. |
| 264 #2 - | |
| -- | [Piscataqay, New Jersey] : |
| -- | IEEE Xplore, |
| -- | [2000] |
| 336 ## - | |
| -- | text |
| -- | rdacontent |
| 337 ## - | |
| -- | electronic |
| -- | isbdmedia |
| 338 ## - | |
| -- | online resource |
| -- | rdacarrier |
| 588 ## - | |
| -- | Description based on PDF viewed 12/23/2015. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Formal methods (Computer science) |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer logic. |
No items available.