Gödel's incompleteness theorems / Raymond M. Smullyan.

Kurt Gödel, the greatest logician of our time, startled the world of mathematics in 1931 with his Theorem of Undecidability, which showed that some statements in mathematics are inherently 'undecidable.' His work on the completeness of logic, the incompleteness of number theory, and the c...

Full description

Saved in:
Bibliographic Details
Main Author: Smullyan, Raymond M. (Author)
Format: eBook
Language:English
Published: New York : Oxford University Press, 2020.
Series:Oxford logic guides ; 19.
Subjects:
Online Access:Click for online access

MARC

LEADER 00000cam a2200000Mi 4500
001 on1222774622
003 OCoLC
005 20241006213017.0
006 m o d
007 cr || ||||||||
008 200915r20201992nyu fob 001 0 eng
040 |a AU@  |b eng  |e rda  |c AU@  |d OCLCO  |d OCLCF  |d ESU  |d STBDS  |d MVS  |d OCLCO  |d OCLCQ  |d OCLCO  |d OCLCL 
020 |a 9780197560037 (ebook) 
020 |a 0197560032 (ebook) 
035 |a (OCoLC)1222774622 
050 4 |a QA9.65 
049 |a HCDD 
100 1 |a Smullyan, Raymond M.,  |e author. 
245 1 0 |a Gödel's incompleteness theorems /  |c Raymond M. Smullyan. 
264 1 |a New York :  |b Oxford University Press,  |c 2020. 
300 |a 1 online resource (160 pages). 
336 |a text  |2 rdacontent 
337 |a computer  |2 rdamedia 
338 |a online resource  |2 rdacarrier 
490 1 |a Oxford logic guides ;  |v 19 
500 |a Previously issued in print: 1992. 
504 |a Includes bibliographical references and index. 
520 8 |a Kurt Gödel, the greatest logician of our time, startled the world of mathematics in 1931 with his Theorem of Undecidability, which showed that some statements in mathematics are inherently 'undecidable.' His work on the completeness of logic, the incompleteness of number theory, and the consistency of the axiom of choice and the continuum theory brought him further worldwide fame. In this introductory volume, Raymond Smullyan, himself a well-known logician, guides the reader through the fascinating world of Gödel's incompleteness theorems. The level of presentation is suitable for anyone with a basic acquaintance with mathematical logic. As a clear, concise introduction to a difficult but essential subject, the text will appeal to mathematicians, philosophers, and computer scientists. 
521 |a Specialized. 
588 |a Description based on print version record and publisher information 
650 0 |a Gödel's theorem. 
650 7 |a Gödel's theorem  |2 fast 
758 |i has work:  |a Gödel's incompleteness theorems (Text)  |1 https://id.oclc.org/worldcat/entity/E39PCGqxTpXTtQptdCMTpKfkKq  |4 https://id.oclc.org/worldcat/ontology/hasWork 
776 0 8 |i Print version  |z 9780195046724 
830 0 |a Oxford logic guides ;  |v 19. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://academic.oup.com/book/40753  |y Click for online access 
903 |a OUP-SOEBA 
994 |a 92  |b HCD