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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | , |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass. :
MIT Press,
2000.
|
| Schriftenreihe: | Foundations of computing.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | 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. |
| Beschreibung: | 1 online resource (xv, 459 pages :) |
| Bibliographie: | Includes bibliographical references and index. |
| ISBN: | 9780262274951 0262274957 1423728335 9781423728337 9780262527668 0262527669 0262263025 9780262263023 |
Internformat
MARC
| LEADER | 00000cam a22000004a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocm61848680 | ||
| 003 | OCoLC | ||
| 005 | 20240705115654.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 |d OCLCL |d SFB |d OCLCQ | ||
| 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) | ||
| 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 | 7 | |a 004/.01/5113 |2 22 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Harel, David, |d 1950- |1 https://id.oclc.org/worldcat/entity/E39PBJkxK7hBVKFgPfXpTQbjmd |0 http://id.loc.gov/authorities/names/n79038969 | |
| 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 :) | ||
| 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. | ||
| 650 | 0 | |a Computer logic. |0 http://id.loc.gov/authorities/subjects/sh97004631 | |
| 650 | 0 | |a Formal methods (Computer science) |0 http://id.loc.gov/authorities/subjects/sh99003622 | |
| 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- |1 https://id.oclc.org/worldcat/entity/E39PBJwD63MVrDKT6RKQkMvJXd |0 http://id.loc.gov/authorities/names/n82026953 | |
| 700 | 1 | |a Tiuryn, Jerzy. | |
| 758 | |i has work: |a Dynamic logic (Text) |1 https://id.oclc.org/worldcat/entity/E39PCH4gTRgtJftgJVTDXg6k6q |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 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. |0 http://id.loc.gov/authorities/names/n83731477 | |
| 856 | 1 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=138542 |3 Volltext | |
| 856 | 1 | |l CBO01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=138542 |3 Volltext | |
| 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 GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocm61848680 |
|---|---|
| _version_ | 1813903285520695297 |
| adam_text | |
| any_adam_object | |
| author | Harel, David, 1950- |
| author2 | Kozen, Dexter, 1951- Tiuryn, Jerzy |
| author2_role | |
| author2_variant | d k dk j t jt |
| author_GND | http://id.loc.gov/authorities/names/n79038969 http://id.loc.gov/authorities/names/n82026953 |
| author_facet | Harel, David, 1950- Kozen, Dexter, 1951- Tiuryn, Jerzy |
| author_role | |
| author_sort | Harel, David, 1950- |
| author_variant | d h dh |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.L63 H37 2000eb |
| callnumber-search | QA76.9.L63 H37 2000eb |
| callnumber-sort | QA 276.9 L63 H37 42000EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | 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. |
| ctrlnum | (OCoLC)61848680 |
| dewey-full | 004/.01/5113 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004/.01/5113 |
| dewey-search | 004/.01/5113 |
| dewey-sort | 14 11 45113 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06223cam a22008774a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocm61848680 </controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20240705115654.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">051006s2000 maua ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCG</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">N$T</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">IEEEE</subfield><subfield code="d">OCLCF</subfield><subfield code="d">NLGGC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">ESU</subfield><subfield code="d">U3W</subfield><subfield code="d">INARC</subfield><subfield code="d">VTS</subfield><subfield code="d">MERER</subfield><subfield code="d">AGLDB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AU@</subfield><subfield code="d">MITPR</subfield><subfield code="d">STF</subfield><subfield code="d">LEAUB</subfield><subfield code="d">HS0</subfield><subfield code="d">UKBTH</subfield><subfield code="d">EBLCP</subfield><subfield code="d">UKSSU</subfield><subfield code="d">LDP</subfield><subfield code="d">LUN</subfield><subfield code="d">OCLCO</subfield><subfield code="d">DST</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">GBA105923</subfield><subfield code="2">bnb</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">1033566843</subfield><subfield code="a">1057976598</subfield><subfield code="a">1108936087</subfield><subfield code="a">1112964140</subfield><subfield code="a">1127102682</subfield><subfield code="a">1154981981</subfield><subfield code="a">1156860252</subfield><subfield code="a">1159644854</subfield><subfield code="a">1167254484</subfield><subfield code="a">1241943896</subfield><subfield code="a">1280236387</subfield><subfield code="a">1281461634</subfield><subfield code="a">1300514328</subfield><subfield code="a">1303347395</subfield><subfield code="a">1303485103</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262274951</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262274957</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1423728335</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781423728337</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262527668</subfield><subfield code="q">(print)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262527669</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262263025</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262263023</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0262082896</subfield><subfield code="q">(alk. hc)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)61848680</subfield><subfield code="z">(OCoLC)1033566843</subfield><subfield code="z">(OCoLC)1057976598</subfield><subfield code="z">(OCoLC)1108936087</subfield><subfield code="z">(OCoLC)1112964140</subfield><subfield code="z">(OCoLC)1127102682</subfield><subfield code="z">(OCoLC)1154981981</subfield><subfield code="z">(OCoLC)1156860252</subfield><subfield code="z">(OCoLC)1159644854</subfield><subfield code="z">(OCoLC)1167254484</subfield><subfield code="z">(OCoLC)1241943896</subfield><subfield code="z">(OCoLC)1280236387</subfield><subfield code="z">(OCoLC)1281461634</subfield><subfield code="z">(OCoLC)1300514328</subfield><subfield code="z">(OCoLC)1303347395</subfield><subfield code="z">(OCoLC)1303485103</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">2516</subfield><subfield code="b">MIT Press</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">9780262274951</subfield><subfield code="b">MIT Press</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.9.L63</subfield><subfield code="b">H37 2000eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">052000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">037000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">013000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">032000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">018000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">014000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">067000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">004/.01/5113</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Harel, David,</subfield><subfield code="d">1950-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJkxK7hBVKFgPfXpTQbjmd</subfield><subfield code="0">http://id.loc.gov/authorities/names/n79038969</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Dynamic logic /</subfield><subfield code="c">David Harel, Dexter Kozen, Jerzy Tiuryn.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge, Mass. :</subfield><subfield code="b">MIT Press,</subfield><subfield code="c">2000.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xv, 459 pages :)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Foundations of computing.</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="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.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer logic.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh97004631</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Formal methods (Computer science)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh99003622</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Logique informatique.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Méthodes formelles (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Reference.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Machine Theory.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Computer Literacy.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Information Technology.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Data Processing.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Computer Science.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Hardware</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer logic</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Formal methods (Computer science)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">COMPUTER SCIENCE/Theoretical Computer Science</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kozen, Dexter,</subfield><subfield code="d">1951-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJwD63MVrDKT6RKQkMvJXd</subfield><subfield code="0">http://id.loc.gov/authorities/names/n82026953</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tiuryn, Jerzy.</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Dynamic logic (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCH4gTRgtJftgJVTDXg6k6q</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Harel, David, 1950-</subfield><subfield code="t">Dynamic logic.</subfield><subfield code="d">Cambridge, Mass. : MIT Press, 2000</subfield><subfield code="z">0262082896</subfield><subfield code="w">(DLC) 00030380</subfield><subfield code="w">(OCoLC)43894182</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Foundations of computing.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n83731477</subfield></datafield><datafield tag="856" ind1="1" ind2=" "><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=138542</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="1" ind2=" "><subfield code="l">CBO01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=138542</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL5965957</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">138542</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">IEEE</subfield><subfield code="b">IEEE</subfield><subfield code="n">6267400</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Internet Archive</subfield><subfield code="b">INAR</subfield><subfield code="n">dynamiclogicfoun00davi_0</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">3411060</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2363816</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocm61848680 |
| illustrated | Illustrated |
| indexdate | 2024-10-25T16:16:15Z |
| institution | BVB |
| isbn | 9780262274951 0262274957 1423728335 9781423728337 9780262527668 0262527669 0262263025 9780262263023 |
| language | English |
| oclc_num | 61848680 |
| open_access_boolean | |
| owner | MAIN |
| owner_facet | MAIN |
| physical | 1 online resource (xv, 459 pages :) |
| psigel | ZDB-4-EBA |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | MIT Press, |
| record_format | marc |
| series | Foundations of computing. |
| series2 | Foundations of computing. |
| spelling | Harel, David, 1950- https://id.oclc.org/worldcat/entity/E39PBJkxK7hBVKFgPfXpTQbjmd http://id.loc.gov/authorities/names/n79038969 Dynamic logic / David Harel, Dexter Kozen, Jerzy Tiuryn. Cambridge, Mass. : MIT Press, 2000. 1 online resource (xv, 459 pages :) text txt rdacontent computer c rdamedia online resource cr rdacarrier Foundations of computing. Includes bibliographical references and index. Print version record. 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. 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. English. Computer logic. http://id.loc.gov/authorities/subjects/sh97004631 Formal methods (Computer science) http://id.loc.gov/authorities/subjects/sh99003622 Logique informatique. Méthodes formelles (Informatique) COMPUTERS Reference. bisacsh COMPUTERS Machine Theory. bisacsh COMPUTERS Computer Literacy. bisacsh COMPUTERS Information Technology. bisacsh COMPUTERS Data Processing. bisacsh COMPUTERS Computer Science. bisacsh COMPUTERS Hardware General. bisacsh Computer logic fast Formal methods (Computer science) fast COMPUTER SCIENCE/Theoretical Computer Science Kozen, Dexter, 1951- https://id.oclc.org/worldcat/entity/E39PBJwD63MVrDKT6RKQkMvJXd http://id.loc.gov/authorities/names/n82026953 Tiuryn, Jerzy. has work: Dynamic logic (Text) https://id.oclc.org/worldcat/entity/E39PCH4gTRgtJftgJVTDXg6k6q https://id.oclc.org/worldcat/ontology/hasWork Print version: Harel, David, 1950- Dynamic logic. Cambridge, Mass. : MIT Press, 2000 0262082896 (DLC) 00030380 (OCoLC)43894182 Foundations of computing. http://id.loc.gov/authorities/names/n83731477 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=138542 Volltext CBO01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=138542 Volltext |
| spellingShingle | Harel, David, 1950- Dynamic logic / Foundations of computing. 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. Computer logic. http://id.loc.gov/authorities/subjects/sh97004631 Formal methods (Computer science) http://id.loc.gov/authorities/subjects/sh99003622 Logique informatique. Méthodes formelles (Informatique) COMPUTERS Reference. bisacsh COMPUTERS Machine Theory. bisacsh COMPUTERS Computer Literacy. bisacsh COMPUTERS Information Technology. bisacsh COMPUTERS Data Processing. bisacsh COMPUTERS Computer Science. bisacsh COMPUTERS Hardware General. bisacsh Computer logic fast Formal methods (Computer science) fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh97004631 http://id.loc.gov/authorities/subjects/sh99003622 |
| title | Dynamic logic / |
| title_auth | Dynamic logic / |
| title_exact_search | Dynamic logic / |
| title_full | Dynamic logic / David Harel, Dexter Kozen, Jerzy Tiuryn. |
| title_fullStr | Dynamic logic / David Harel, Dexter Kozen, Jerzy Tiuryn. |
| title_full_unstemmed | Dynamic logic / David Harel, Dexter Kozen, Jerzy Tiuryn. |
| title_short | Dynamic logic / |
| title_sort | dynamic logic |
| topic | Computer logic. http://id.loc.gov/authorities/subjects/sh97004631 Formal methods (Computer science) http://id.loc.gov/authorities/subjects/sh99003622 Logique informatique. Méthodes formelles (Informatique) COMPUTERS Reference. bisacsh COMPUTERS Machine Theory. bisacsh COMPUTERS Computer Literacy. bisacsh COMPUTERS Information Technology. bisacsh COMPUTERS Data Processing. bisacsh COMPUTERS Computer Science. bisacsh COMPUTERS Hardware General. bisacsh Computer logic fast Formal methods (Computer science) fast |
| topic_facet | Computer logic. Formal methods (Computer science) Logique informatique. Méthodes formelles (Informatique) COMPUTERS Reference. COMPUTERS Machine Theory. COMPUTERS Computer Literacy. COMPUTERS Information Technology. COMPUTERS Data Processing. COMPUTERS Computer Science. COMPUTERS Hardware General. Computer logic |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=138542 |
| work_keys_str_mv | AT hareldavid dynamiclogic AT kozendexter dynamiclogic AT tiurynjerzy dynamiclogic |