%0 Book %1 Goldblatt92 %A Goldblatt, Robert %B CSLI Lecture Notes %C Stanford, CA %D 1992 %I Center for the Study of Language and Information %K v1205 book computer theory logic temporal %N 7 %T Logics of Time and Computation %X This is a short but excellent introduction to modal, temporal, and dynamic logic. It manages to cover, in highly readable style, the basic completeness, decidability, and expressability results in a variety of logics of the three kinds considered. Now revised and significantly expanded, this textbook introduces modal logic and examines the relevance of modal systems for theoretical computer science. Golblatt sets out a basic theory of normal modal and temporal propositional logics, including issues such as completeness proofs, decidability, first-order defiability, and canonicity. The basic theory is then applied to logics of discrete, dense, and continuous time; to the temporal logic of concurrent programs involving the connectives henceforth, next , anduntil; and to the dynamic logic of regular programs. New material for the second edition extends the temporal logic of concurrency to branching time, studying a system of Computational Tree Logic that formalizes reasoning about behavior. Dynamic logic is also extended to the case of concurrency, intorducing a connective for the parallel execution of commands. A seperate section is devoted to the quantificational dynamic logic. Numerous excercises are included for use in the classroom. %7 2 %@ 978-0-937073-94-0

@book{Goldblatt92, abstract = {This is a short but excellent introduction to modal, temporal, and dynamic logic. It manages to cover, in highly readable style, the basic completeness, decidability, and expressability results in a variety of logics of the three kinds considered. Now revised and significantly expanded, this textbook introduces modal logic and examines the relevance of modal systems for theoretical computer science. Golblatt sets out a basic theory of normal modal and temporal propositional logics, including issues such as completeness proofs, decidability, first-order defiability, and canonicity. The basic theory is then applied to logics of discrete, dense, and continuous time; to the temporal logic of concurrent programs involving the connectives henceforth, next , anduntil; and to the dynamic logic of regular programs. New material for the second edition extends the temporal logic of concurrency to branching time, studying a system of Computational Tree Logic that formalizes reasoning about behavior. Dynamic logic is also extended to the case of concurrency, intorducing a connective for the parallel execution of commands. A seperate section is devoted to the quantificational dynamic logic. Numerous excercises are included for use in the classroom.}, added-at = {2012-05-30T10:46:35.000+0200}, address = {Stanford, CA}, author = {Goldblatt, Robert}, biburl = {https://www.bibsonomy.org/bibtex/2cf5b166a464e2e3cb68b8966ef4c561a/flint63}, description = {Edition 1 1987 ISBN 978-0-937073-12-4}, edition = 2, file = {CSLI Product Page:http\://cslipublications.stanford.edu/site/0937073946.shtml:URL;Amazon Search inside:http\://www.amazon.de/gp/reader/0937073946/:URL;Google Books:http\://books.google.de/books?isbn=978-0-937073-94-0:URL}, groups = {public}, interhash = {72a3d13749d7a46816cd3cb0562518ec}, intrahash = {cf5b166a464e2e3cb68b8966ef4c561a}, isbn = {978-0-937073-94-0}, keywords = {v1205 book computer theory logic temporal}, number = 7, publisher = {Center for the Study of Language and Information}, series = {CSLI Lecture Notes}, timestamp = {2018-04-16T12:13:35.000+0200}, title = {Logics of Time and Computation}, username = {flint63}, year = 1992 }