𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computability and logic

✍ Scribed by George S. Boolos, John P. Burgess, Richard C. Jeffrey


Book ID
127418145
Publisher
Cambridge University Press
Year
2002
Tongue
English
Weight
2 MB
Edition
4th ed
Category
Library
City
Cambridge; New York
ISBN-13
9780521809757

No coin nor oath required. For personal study only.

✦ Synopsis


Now in its fourth edition, this book has become a classic because of its accessibility to students without a mathematical background, and because it covers not only the staple topics of an intermediate logic course such as Godel's Incompleteness Theorems, but also a large number of optional topics from Turing's theory of computability to Ramsey's theorem. John Burgess has enhanced the book by adding a selection of problems at the end of each chapter.


πŸ“œ SIMILAR VOLUMES


Computability and Logic
✍ George S. Boolos, John P. Burgess, Richard C. Jeffrey πŸ“‚ Library πŸ“… 2007 πŸ› Cambridge University Press 🌐 English βš– 2 MB

Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel's incompleteness theorems, but also a large number of optional topics, from Turing

Computability, complexity, logic
✍ E. BΓΆrger πŸ“‚ Library πŸ“… 1989 πŸ› North-Holland 🌐 English βš– 4 MB

The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems. T

Discrete structures, logic, and computab
✍ James L. Hein πŸ“‚ Library πŸ“… 1995 πŸ› Jones and Bartlett 🌐 English βš– 6 MB

This text introduces the beginning computer science student to some of the fundamental ideas and techniques used by computer scientists today, focusing on discrete structures, logic and computability. The emphasis is on the computational aspects, so that the reader can see how the concepts are ac

Introduction to computability logic
✍ Giorgi Japaridze πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 718 KB
On computability by logic programs
✍ Andrei Voronkov πŸ“‚ Article πŸ“… 1995 πŸ› Springer Netherlands 🌐 English βš– 868 KB