Listing 1 - 10 of 24 | << page >> |
Sort by
|
Choose an application
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
Mathematical logic --- Gödel, Kurt --- 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
Kurt GoÌ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 GoÌ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.
GoÌ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 --- גדל
Choose an application
Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the sixteenth publication in the Lecture Notes in Logic series, gives a sustained presentation of a particular view of the topic of Gödelian extensions of theories. It presents the basic material in predicate logic, set theory and recursion theory, leading to a proof of Gödel's incompleteness theorems. The inexhaustibility of mathematics is treated based on the concept of transfinite progressions of theories as conceived by Turing and Feferman. All concepts and results are introduced as needed, making the presentation self-contained and thorough. Philosophers, mathematicians and others will find the book helpful in acquiring a basic grasp of the philosophical and logical results and issues.
Incompleteness theorem --- Logic, Symbolic and mathematical. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Incompleteness theorems. --- Theorems, Incompleteness --- Constructive mathematics --- Proof theory
Choose an application
Mathematical logic --- Recursive functions. --- Algorithms. --- Godel's theorem. --- Gödel's incompleteness theorem --- Undecidable theories --- Arithmetic --- Completeness theorem --- Incompleteness theorems --- Logic, Symbolic and mathematical --- Number theory --- Decidability (Mathematical logic) --- Algorism --- Algebra --- Functions, Recursive --- Algorithms --- Recursion theory --- Foundations --- Gödel's theorem --- Recursive functions
Choose an application
"Among the many expositions of Godel's incompleteness theorems written for non-specialists, this book stands apart. With exceptional clarity, Franzen 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 Godel
Mathematical logic --- Philosophy of science --- Gödel's theorem --- Gödel's theorem. --- Incompleteness theorems. --- Gödel's theorem --- Incompleteness theorems --- Gödel's incompleteness theorem --- Undecidable theories --- Arithmetic --- Completeness theorem --- Logic, Symbolic and mathematical --- Number theory --- Decidability (Mathematical logic) --- Theorems, Incompleteness --- Constructive mathematics --- Proof theory --- Foundations --- Logique mathématique --- Gödel, Kurt F., 1906 --- -Logique mathématique --- Logique mathematique --- Theorie de la preuve --- -Gödel's theorem.
Choose an application
Mathematical logic --- Gödel's theorem --- Gödel, Théorème de --- Godel's theorem --- #TELE:MI2 --- Gödel's incompleteness theorem --- Undecidable theories --- Arithmetic --- Completeness theorem --- Incompleteness theorems --- Logic, Symbolic and mathematical --- Number theory --- Decidability (Mathematical logic) --- Foundations --- Gödel's theorem --- Gödel, Théorème de
Choose an application
"An introduction to the life and thought of Kurt Gödel, who transformed our conception of math forever"--Provided by publisher.
Logicians --- Proof theory. --- Gödel, Kurt. --- Gödel's theorem --- Proof theory --- Gödel's incompleteness theorem --- Undecidable theories --- Gödel, Kurt. --- Gkentel, Kourt --- גדל --- Logic, Symbolic and mathematical --- Philosophers --- Arithmetic --- Completeness theorem --- Incompleteness theorems --- Number theory --- Decidability (Mathematical logic) --- Foundations --- Logicians - United States - Biography. --- Logicians - Austria - Biography.
Choose an application
510.2 --- Godel's theorem --- Incompleteness theorems --- Metamathematics --- Logic, Symbolic and mathematical --- Mathematics --- Theorems, Incompleteness --- Constructive mathematics --- Proof theory --- Gödel's incompleteness theorem --- Undecidable theories --- Arithmetic --- Completeness theorem --- Number theory --- Decidability (Mathematical logic) --- Foundations of mathematics --- Philosophy --- Foundations --- Gödel's theorem --- Incompleteness theorems. --- Metamathematics. --- 510.2 Foundations of mathematics --- Gödel's theorem. --- Gödel's theorem
Choose an application
Gödel, Kurt --- 510.65 --- Godel's theorem --- 51-8 --- Gödel's incompleteness theorem --- Undecidable theories --- Completeness theorem --- Incompleteness theorems --- Decidability (Mathematical logic) --- Logico-mathematical theories. Formal arithmetic. Formal number theory --- Mathematical games and recreations --- 51-8 Mathematical games and recreations --- 510.65 Logico-mathematical theories. Formal arithmetic. Formal number theory --- Arithmetic --- Logic, Symbolic and mathematical --- Number theory --- Foundations --- Mathematical logic
Listing 1 - 10 of 24 | << page >> |
Sort by
|