**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

**Rule-based Computation and Deduction**

by

**Helene Kirchner, Pierre-Etienne Moreau**-

**ESSLLI**

This text first introduces the concept of rewriting which is behind rule-based systems. Then the rewriting logic and the rewriting calculus are defined and shown to be especially suited to describing concurrent and non-deterministic computations.

(

**6433**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.

(

**6605**views)

**Introduction to Computing: Explorations in Language, Logic, and Machines**

by

**David Evans**-

**University of Virginia**

An introduction to the most important ideas in computing. It focuses on how to describe information processes by defining procedures, how to analyze the costs required to carry out a procedure, and the limits of what can be computed mechanically.

(

**11405**views)

**Bayesian Computational Methods**

by

**Christian P. Robert**-

**arXiv**

We will first present the most standard computational challenges met in Bayesian Statistics, focusing primarily on mixture estimation and on model choice issues, and then relate these problems with computational solutions.

(

**6491**views)