**Logic and Proof**

by Lawrence C Paulson

**Publisher**: University of Cambridge 2002**Number of pages**: 79

**Description**:

These lecture notes give a brief introduction to logic, with including the resolution method of theorem-proving and its relation to the programming language Prolog. Formal logic is used for specifying and verifying computer systems and (sometimes) for representing knowledge in Artificial Intelligence programs.

Download or read it online for free here:

**Download link**

(290KB, PDF)

## Similar books

**Applicative Computing: Its quarks, atoms and molecules**

by

**V. E. Wolfengagen**-

**JurInfoR**

This work covers the advanced topics in main ideas of computing in general. Material is especially useful for the instructor, postgraduate and graduate students of IT-specialties and is suitable for the system of training of specialists.

(

**9158**views)

**Models of Computation: Exploring the Power of Computing**

by

**John E. Savage**-

**Addison-Wesley**

The book re-examines computer science, giving priority to resource tradeoffs and complexity classifications over the structure of machines and their relationships to languages. This viewpoint is motivated by more realistic computational models.

(

**6845**views)

**Languages and Machines**

by

**C. D. H. Cooper**-

**Macquarie University**

This is a text on discrete mathematics. It includes chapters on logic, set theory and strings and languages. There are some chapters on finite-state machines, some chapters on Turing machines and computability, and a couple of chapters on codes.

(

**17515**views)

**Introduction to Theory of Computation**

by

**Anil Maheshwari, Michiel Smid**-

**Carleton University**

This is a textbook for an undergraduate course on the Theory of Computation. Contents: Finite Automata and Regular Languages; Context-Free Languages; Turing Machines and Church-Turing Thesis; Decidable and Undecidable Languages; Complexity Theory.

(

**6426**views)