Proofs and algorithms : an introduction to logic and computability

Resource Information

The work Proofs and algorithms : an introduction to logic and computability represents a distinct intellectual or artistic creation found in University of Missouri Libraries. This resource is a combination of several types including: Work, Language Material, Books.

Label

Proofs and algorithms : an introduction to logic and computability

Title remainder

an introduction to logic and computability

Statement of responsibility

Gilles Dowek

Creator

• Dowek, Gilles

Subject

• Algorithms
• Algorithms
• Informatique
• Logic, Symbolic and mathematical
• Logic, Symbolic and mathematical
• Logic, Symbolic and mathematical
• Algorithms

Language

eng

Summary

Proofs and Algorithms: An Introduction to Logic and Computability Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation. Proofs and Algorithms: An Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, Gödel's incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself. Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic

Member of

• Undergraduate topics in computer science

Cataloging source

GW5XE

Dewey number

005.13/1

Index

index present

Language note

English

LC call number

QA9

LC item number

.D69 2011

Literary form

non fiction

Nature of contents

• dictionaries
• bibliography

Series statement

Undergraduate topics in computer science