Logo

Logic and Proof by Lawrence C Paulson

Small book cover: Logic and Proof

Logic and Proof
by

Publisher: University of Cambridge
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.

Home page url

Download or read it online for free here:
Download link
(290KB, PDF)

Similar books

Book cover: Introduction to Theory of ComputationIntroduction to Theory of Computation
by - 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.
(8339 views)
Book cover: Models of Computation: Exploring the Power of ComputingModels of Computation: Exploring the Power of Computing
by - 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.
(8055 views)
Book cover: Introduction to Computing: Explorations in Language, Logic, and MachinesIntroduction to Computing: Explorations in Language, Logic, and Machines
by - 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.
(12772 views)
Book cover: Rule-based Computation and DeductionRule-based Computation and Deduction
by - 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.
(7667 views)