Metamathematics, machines, and Gödel's proof / N. Shankar.

Mathematicians from Leibniz to Hilbert have sought to mechanise the verification of mathematical proofs. Developments arising out of Gödel's proof of his incompleteness theorem showed that no computer program could automatically prove true all the theorems of mathematics. In practice, however,...

Full description

Bibliographic Details
Main Author: Shankar, N., (Author)
Format: Book
Language:English
Published: Cambridge : Cambridge University Press, 1994.
Series:Cambridge tracts in theoretical computer science ; 38.
Subjects:
Online Access:CONNECT

Similar Items