Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Logic, Symbolic and mathematical. --- Logique mathématique. --- Set theory. --- Théorie des ensembles. --- Completeness theorem. --- Complétude, Théorème de.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Decidability (Mathematical logic) --- Completeness theorem. --- Incompleteness theorems. --- Theorems, Incompleteness --- Constructive mathematics --- Proof theory --- Logic, Symbolic and mathematical --- Model theory --- Computable functions --- Gödel's theorem --- Recursive functions

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

510.67 --- Completeness theorem --- Logic, Symbolic and mathematical --- Model theory --- 510.67 Theory of models --- Theory of models --- Complétude, Théorème de --- Introduction --- Completeness theorem. --- Mathematics (General) --- Mathematics (General). --- Model theory. --- 510.6 --- 510.6 Mathematical logic --- Mathematical logic --- Logique mathématique --- Théorie des modèles --- Logique mathématique. --- Théorie des modèles. --- Complétude, Théorème de. --- Introduction. --- Théorie des modèles --- Logique mathématique

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Gödel's theorem --- Gödel's theorem --- Gödel's incompleteness theorem --- Undecidable theories --- Arithmetic --- Completeness theorem --- Incompleteness theorems --- Logic, Symbolic and mathematical --- Number theory --- Decidability (Mathematical logic) --- Foundations

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Gödel's theorem. --- Gödel's theorem. --- Gödel, Kurt. --- Gödel's incompleteness theorem --- Undecidable theories --- Arithmetic --- Completeness theorem --- Incompleteness theorems --- Logic, Symbolic and mathematical --- Number theory --- Decidability (Mathematical logic) --- Foundations --- Gkentel, Kourt --- גדל