Gödel's Theorem

Regular price €47.99
Quantity:
Ships in 10-20 days
Delivery/Collection within 10-20 working days
Shipping & Delivery
A01=Torkel Franzen
algorithmic information theory
Arithmetical Component
Arithmetical Sentence
Arithmetical Statement
Arithmetical Theorems
Author_Torkel Franzen
Ayn Rand's Philosophy
Ayn Rand’s Philosophy
Category=PBCD
Completeness Theorem
computability theory
Computably Enumerable
Consistency Proof
Consistent Formal Systems
Diophantine Equation
Elementary Arithmetic
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
formal proof techniques
Goldbach's Conjecture
Goldbach’s Conjecture
Incompleteness Theorem
Kolmogorov Complexity
Large Cardinal Axioms
logic and philosophy
mathematical logic foundations
mathematical skepticism
misuse of incompleteness theorem debates
Natural Numbers
Nonstandard Models
Nth Bit
Numerical Strings
Ordinary Mathematical
Predicate Logic
Soundness Theorem
Twin Prime Conjecture
Undecidability Theorem
Undecidable Statements

Product details

  • ISBN 9781568812380
  • Weight: 260g
  • Dimensions: 152 x 229mm
  • Publication Date: 06 Jun 2005
  • Publisher: Taylor & Francis Inc
  • Publication City/Country: US
  • Product Form: Paperback
Secure checkout Fast Shipping Easy returns

"Among the many expositions of Gödel's incompleteness theorems written for non-specialists, this book stands apart. With exceptional clarity, Franzén gives careful, non-technical explanations both of what those theorems say and, more importantly, what they do not. No other book aims, as his does, to address in detail the misunderstandings and abuses of the incompleteness theorems that are so rife in popular discussions of their significance. As an antidote to the many spurious appeals to incompleteness in theological, anti-mechanist and post-modernist debates, it is a valuable addition to the literature." --- John W. Dawson, author of Logical Dilemmas: The Life and Work of Kurt Gödel

A philosopher by training (PhD, University of Stockholm), Torkel Franzen has for the past twenty years been active working in computer science (at the Swedish Institute of Computer Science). He is the author of a number of books, among them Inexhaustibility: A Non-Exhaustive Treatment.

More from this author