Cargando…
Dynamic logic /
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 descri...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Otros Autores: | , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cambridge, Mass. :
MIT Press,
2000.
|
| Colección: | Foundations of computing.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a22000004a 4500 | ||
|---|---|---|---|
| 001 | EBSCO_ocm61848680 | ||
| 003 | OCoLC | ||
| 005 | 20231017213018.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 051006s2000 maua ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d OCLCQ |d OCLCG |d OCLCQ |d N$T |d OCLCQ |d OCLCO |d OCLCQ |d IEEEE |d OCLCF |d NLGGC |d OCLCQ |d YDXCP |d OCLCQ |d ESU |d U3W |d INARC |d VTS |d MERER |d AGLDB |d OCLCQ |d AU@ |d MITPR |d STF |d LEAUB |d HS0 |d UKBTH |d EBLCP |d UKSSU |d LDP |d LUN |d OCLCO |d DST |d OCLCQ |d OCLCO | ||
| 015 | |a GBA105923 |2 bnb | ||
| 019 | |a 1033566843 |a 1057976598 |a 1108936087 |a 1112964140 |a 1127102682 |a 1154981981 |a 1156860252 |a 1159644854 |a 1167254484 |a 1241943896 |a 1280236387 |a 1281461634 |a 1300514328 |a 1303347395 |a 1303485103 | ||
| 020 | |a 9780262274951 |q (electronic bk.) | ||
| 020 | |a 0262274957 |q (electronic bk.) | ||
| 020 | |a 1423728335 | ||
| 020 | |a 9781423728337 | ||
| 020 | |a 9780262527668 |q (print) | ||
| 020 | |a 0262527669 | ||
| 020 | |a 0262263025 | ||
| 020 | |a 9780262263023 | ||
| 020 | |z 0262082896 |q (alk. hc) | ||
| 029 | 1 | |a AU@ |b 000051284533 | |
| 029 | 1 | |a AU@ |b 000051361382 | |
| 029 | 1 | |a DEBBG |b BV042508908 | |
| 029 | 1 | |a DEBBG |b BV043044493 | |
| 029 | 1 | |a DEBSZ |b 422308099 | |
| 029 | 1 | |a GBVCP |b 801345855 | |
| 029 | 1 | |a NZ1 |b 14171568 | |
| 035 | |a (OCoLC)61848680 |z (OCoLC)1033566843 |z (OCoLC)1057976598 |z (OCoLC)1108936087 |z (OCoLC)1112964140 |z (OCoLC)1127102682 |z (OCoLC)1154981981 |z (OCoLC)1156860252 |z (OCoLC)1159644854 |z (OCoLC)1167254484 |z (OCoLC)1241943896 |z (OCoLC)1280236387 |z (OCoLC)1281461634 |z (OCoLC)1300514328 |z (OCoLC)1303347395 |z (OCoLC)1303485103 | ||
| 037 | |a 2516 |b MIT Press | ||
| 037 | |a 9780262274951 |b MIT Press | ||
| 050 | 4 | |a QA76.9.L63 |b H37 2000eb | |
| 072 | 7 | |a COM |x 052000 |2 bisacsh | |
| 072 | 7 | |a COM |x 037000 |2 bisacsh | |
| 072 | 7 | |a COM |x 013000 |2 bisacsh | |
| 072 | 7 | |a COM |x 032000 |2 bisacsh | |
| 072 | 7 | |a COM |x 018000 |2 bisacsh | |
| 072 | 7 | |a COM |x 014000 |2 bisacsh | |
| 072 | 7 | |a COM |x 067000 |2 bisacsh | |
| 082 | 0 | 4 | |a 004/.01/5113 |2 22 |
| 049 | |a UAMI | ||
| 100 | 1 | |a Harel, David, |d 1950- | |
| 245 | 1 | 0 | |a Dynamic logic / |c David Harel, Dexter Kozen, Jerzy Tiuryn. |
| 260 | |a Cambridge, Mass. : |b MIT Press, |c 2000. | ||
| 300 | |a 1 online resource (xv, 459 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Foundations of computing. | |
| 504 | |a Includes bibliographical references and index. | ||
| 588 | 0 | |a Print version record. | |
| 520 | |a 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. | ||
| 505 | 0 | |a I. Fundamental Concepts -- 1. Mathematical Preliminaries -- 2. Computability and Complexity -- 3. Logic -- 4. Reasoning About Programs -- II. Propositional Dynamic Logic -- 5. Propositional Dynamic Logic -- 6. Filtration and Decidability -- 7. Deductive Completeness -- 8. Complexity of PDL -- 9. Nonregular PDL -- 10. Other Variants of PDL -- III. First-Order Dynamic Logic -- 11. First-Order Dynamic Logic -- 12. Relationships with Static Logics -- 13. Complexity -- 14. Axiomatization -- 15. Expressive Power -- 16. Variants of DL -- 17. Other Approaches. | |
| 546 | |a English. | ||
| 590 | |a eBooks on EBSCOhost |b EBSCO eBook Subscription Academic Collection - Worldwide | ||
| 650 | 0 | |a Computer logic. | |
| 650 | 0 | |a Formal methods (Computer science) | |
| 650 | 6 | |a Logique informatique. | |
| 650 | 6 | |a Méthodes formelles (Informatique) | |
| 650 | 7 | |a COMPUTERS |x Reference. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Machine Theory. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Computer Literacy. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Information Technology. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Data Processing. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Computer Science. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Hardware |x General. |2 bisacsh | |
| 650 | 7 | |a Computer logic |2 fast | |
| 650 | 7 | |a Formal methods (Computer science) |2 fast | |
| 653 | |a COMPUTER SCIENCE/Theoretical Computer Science | ||
| 700 | 1 | |a Kozen, Dexter, |d 1951- | |
| 700 | 1 | |a Tiuryn, Jerzy. | |
| 776 | 0 | 8 | |i Print version: |a Harel, David, 1950- |t Dynamic logic. |d Cambridge, Mass. : MIT Press, 2000 |z 0262082896 |w (DLC) 00030380 |w (OCoLC)43894182 |
| 830 | 0 | |a Foundations of computing. | |
| 856 | 4 | 0 | |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=138542 |z Texto completo |
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL5965957 | ||
| 938 | |a EBSCOhost |b EBSC |n 138542 | ||
| 938 | |a IEEE |b IEEE |n 6267400 | ||
| 938 | |a Internet Archive |b INAR |n dynamiclogicfoun00davi_0 | ||
| 938 | |a YBP Library Services |b YANK |n 3411060 | ||
| 938 | |a YBP Library Services |b YANK |n 2363816 | ||
| 994 | |a 92 |b IZTAP | ||