Logo

Logics of Time and Computation

Large book cover: Logics of Time and Computation

Logics of Time and Computation
by

Publisher: Center for the Study of Language
ISBN/ASIN: 0937073946
ISBN-13: 9780937073940
Number of pages: 200

Description:
Sets out the basic theory of normal modal and temporal propositional logics; applies this theory to logics of discrete (integer), dense (rational), and continuous (real) time, to the temporal logic of henceforth, next, and until, and to the propositional dynamic logic of regular programs.

Download or read it online for free here:
Download link
(6.8MB, PDF)

Similar books

Book cover: The Haskell Road to Logic, Maths and ProgrammingThe Haskell Road to Logic, Maths and Programming
by - College Publications
The purpose of this book is to teach logic and mathematical reasoning in practice, and to connect logical reasoning with computer programming. The programming language that will be our tool for this is Haskell, a member of the Lisp family.
(12887 views)
Book cover: Introduction to Mathematical Logic: A problem solving courseIntroduction to Mathematical Logic: A problem solving course
by - arXiv
This is a set of questions written for a course in Mathematical Logic. Topics covered are: propositional logic; axioms of ZFC; wellorderings and equivalents of AC; ordinal and cardinal arithmetic; first order logic, and the compactness theorem; etc.
(9202 views)
Book cover: Introduction to Mathematical PhilosophyIntroduction to Mathematical Philosophy
by - University of Massachusetts Amherst
A very accessible mathematical classic. It sets forth in elementary form the logical definition of number, the analysis of the notion of order, the modern doctrine of the infinite, and the theory of descriptions and classes as symbolic fictions.
(10317 views)
Book cover: Lectures on Linear LogicLectures on Linear Logic
by - CSLI
This text deals with logical formalism, cut-elimination, the embedding of intuitionistic logic in classical linear logic, proofnets for the multiplicative fragment and the algorithmic interpretation of cut-elimination in proofnets.
(7941 views)