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
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.
(14097 views)
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.
(14097 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.
(9290 views)
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.
(9290 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.
(10071 views)
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.
(10071 views)
An Introduction to the Theory of Computation
by Eitan Gurari - Computer Science Pr
The book explores questions and terminologies concerning programs, computers, and computation. The exploration reduces to a study of mathematical theories, such as those of automata and formal languages, theories interesting in their own right.
(29668 views)
by Eitan Gurari - Computer Science Pr
The book explores questions and terminologies concerning programs, computers, and computation. The exploration reduces to a study of mathematical theories, such as those of automata and formal languages, theories interesting in their own right.
(29668 views)