Logic for Computer Science
Publisher: Wikibooks 2010
This book discusses logic as a tool for computer science; a field that uses logic at all levels. It provides a survey of mathematical logic and its various applications. After covering basic material of propositional logic and first-order logic, the course presents the foundations of finite model theory and descriptive complexity.
Home page url
Download or read it online for free here:
by Arnold W. Miller - 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.
by Vilnis Detlovs, Karlis Podnieks - University of Latvia
From the table of contents: 1. Introduction. What Is Logic, Really?; 2. Propositional Logic; 3. Predicate Logic; 4. Completeness Theorems (Model Theory); 5. Normal Forms. Resolution Method; 6. Miscellaneous (Negation as Contradiction or Absurdity).
by Uli Furbach - Wikibooks
This book is intended for computer scientists and it assumes only some basic mathematical notions like relations and orderings. The aim was to create an interactive script where logics can be experienced by interaction and experimentation.
by Wolfram Pohlers, Thomas Glass
This text treats pure logic and in this connection introduces to basic proof-theoretic techniques. Fundamentals of model theory and those of recursion theory are dealt with. Furthermore, some extensions of first order logic are treated.