Table of contents
About this book
The theory of computation is based on concepts defined by logicians and mathematicians. Logic plays a fundamental role in computer science, and this book explains the basic theorems, as well as different techniques of proving them in classical and some non-classical logics. Important applications derived from concepts of logic for computer technology include Artificial Intelligence and Software Engineering.
Providing an in-depth introduction to fundamental classical and non-classical logics, this textbook offers a comprehensive survey of logics for computer scientists. Logics for Computer Science contains intuitive introductory chapters explaining the need for logical investigations, motivations for different types of logics and some of their history. They are followed by strict formal approach chapters. All chapters contain many detailed examples explaining each of the introduced notions and definitions, well chosen sets of exercises with carefully written solutions, and sets of homework.
Includes links to the author's companion lecture slides for each chapter: several hundred presentations which summarize the ideas presented in the chapters for ease of comprehension.
Symbolic logic propositional languages predicate languages classical semantics non-classical semantics intuitionistic logic modal logics Hilbert style formalizations Gentzen style formalizations automated theorem proving Formal methods completeness theorem Godel Theorems many-valued logics Boolean algebras
- DOI https://doi.org/10.1007/978-3-319-92591-2
- Copyright Information Springer Nature Switzerland AG 2018
- Publisher Name Springer, Cham
- eBook Packages Computer Science
- Print ISBN 978-3-319-92590-5
- Online ISBN 978-3-319-92591-2
- Buy this book on publisher's site