Choose an application

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

Gerhard Gentzen is best known for his development of the proof systems of natural deduction and sequent calculus, central in many areas of logic and computer science today. Another noteworthy achievement is his resolution of the embarrassing situation created by Gödel's incompleteness results, especially the second one about the unprovability of consistency of elementary arithmetic. After these successes, Gentzen dedicated the rest of his short life to the main problem of Hilbert's proof theory, the question of the consistency of analysis. He was arrested in the summer of 1945 with other professors of the German University of Prague and died soon afterward of starvation in a prison cell. Attempts at locating his lost manuscripts failed at the time, but several decades later, two slim folders of shorthand notes were found. In this volume, Jan von Plato gives an overview of Gentzen's life and scientific achievements, based on detailed archival and systematic studies, and essential for placing the translations of shorthand manuscripts that follow in the right setting. The materials in this book are singular in the way they show the birth and development of Gentzen's central ideas and results, sometimes in a well-developed form, and other times as flashes into the anatomy of the workings of a unique mind.

Mathematics. --- History. --- Mathematical logic. --- History of Mathematical Sciences. --- Mathematical Logic and Foundations. --- Mathematics --- Gentzen, Gerhard. --- Math --- Science --- Logic, Symbolic and mathematical. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Annals --- Auxiliary sciences of history

Choose an application

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

The information age owes its existence to a little-known but crucial development, the theoretical study of logic and the foundations of mathematics. The Great Formal Machinery Works draws on original sources and rare archival materials to trace the history of the theories of deduction and computation that laid the logical foundations for the digital revolution.Jan von Plato examines the contributions of figures such as Aristotle; the nineteenth-century German polymath Hermann Grassmann; George Boole, whose Boolean logic would prove essential to programming languages and computing; Ernst Schröder, best known for his work on algebraic logic; and Giuseppe Peano, cofounder of mathematical logic. Von Plato shows how the idea of a formal proof in mathematics emerged gradually in the second half of the nineteenth century, hand in hand with the notion of a formal process of computation. A turning point was reached by 1930, when Kurt Gödel conceived his celebrated incompleteness theorems. They were an enormous boost to the study of formal languages and computability, which were brought to perfection by the end of the 1930s with precise theories of formal languages and formal deduction and parallel theories of algorithmic computability. Von Plato describes how the first theoretical ideas of a computer soon emerged in the work of Alan Turing in 1936 and John von Neumann some years later.Shedding new light on this crucial chapter in the history of science, The Great Formal Machinery Works is essential reading for students and researchers in logic, mathematics, and computer science.

Information technology --- Computers --- History. --- Arend Heyting. --- Begriffsschrift. --- Bertrand Russell. --- David Hilbert. --- Earth. --- Ernst Schröder. --- Eugenio Beltrami. --- Gentzen. --- George Boole. --- Gerard Gentzen. --- Gottlob Frege. --- Guiseppe Peano. --- Gödel. --- Göttingen. --- Hermann Grassmann. --- Heyting algebras. --- Hilbert. --- Karl Menger. --- Kurt Gödel. --- Kurt Hensel. --- Leopold Kronecker. --- Moritz Schlick. --- Paul Bernays. --- Peano. --- Principia Mathematica. --- Rudolf Carnap. --- Thoralf Skolem. --- Vienna Circle. --- algebraic equations. --- algebraic logic. --- algorithmic computability. --- angles. --- arithmetic. --- assumptions. --- axioms. --- basic notions. --- calculus. --- classical arithmetic. --- computation. --- connectives. --- contemporary logic. --- deduction. --- deductive reasoning. --- digital revolution. --- finitary reasoning. --- finitism. --- geometry. --- hypothetic reasoning. --- incompleteness theorems. --- indirect proofs. --- inference. --- information age. --- intuistic arithmetic. --- lattice theory. --- logic. --- logical empiricism. --- logical structure. --- logical truths. --- mathematical logic. --- mathematical proofs. --- mathematical roots. --- mathematics. --- negation. --- non-Euclidan geometries. --- notation. --- one-place predicates. --- parallel postulate. --- philosophy. --- programming language. --- proof. --- pure thinking. --- quantificational inferences. --- theorems. --- triangles.

Choose an application

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

Kurt Gödel (1906–1978) shook the mathematical world in 1931 by a result that has become an icon of 20th century science: The search for rigour in proving mathematical theorems had led to the formalization of mathematical proofs, to the extent that such proving could be reduced to the application of a few mechanical rules. Gödel showed that whenever the part of mathematics under formalization contains elementary arithmetic, there will be arithmetical statements that should be formally provable but aren’t. The result is known as Gödel’s first incompleteness theorem, so called because there is a second incompleteness result, embodied in his answer to the question "Can mathematics be proved consistent?" This book offers the first examination of Gödel’s preserved notebooks from 1930, written in a long-forgotten German shorthand, that show his way to the results: his first ideas, how they evolved, and how the jewel-like final presentation in his famous publication On formally undecidable propositions was composed.The book also contains the original version of Gödel’s incompleteness article, as handed in for publication with no mentioning of the second incompleteness theorem, as well as six contemporary lectures and seminars Gödel gave between 1931 and 1934 in Austria, Germany, and the United States. The lectures are masterpieces of accessible presentations of deep scientific results, readable even for those without special mathematical training, and published here for the first time.

Mathematical logic --- Mathematics --- History --- geschiedenis --- wiskunde

Choose an application

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

Choose an application

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

The information age owes its existence to a little-known but crucial development, the theoretical study of logic and the foundations of mathematics. The Great Formal Machinery Works draws on original sources and rare archival materials to trace the history of the theories of deduction and computation that laid the logical foundations for the digital revolution.Jan von Plato examines the contributions of figures such as Aristotle; the nineteenth-century German polymath Hermann Grassmann; George Boole, whose Boolean logic would prove essential to programming languages and computing; Ernst Schröder, best known for his work on algebraic logic; and Giuseppe Peano, cofounder of mathematical logic. Von Plato shows how the idea of a formal proof in mathematics emerged gradually in the second half of the nineteenth century, hand in hand with the notion of a formal process of computation. A turning point was reached by 1930, when Kurt Gödel conceived his celebrated incompleteness theorems. They were an enormous boost to the study of formal languages and computability, which were brought to perfection by the end of the 1930s with precise theories of formal languages and formal deduction and parallel theories of algorithmic computability. Von Plato describes how the first theoretical ideas of a computer soon emerged in the work of Alan Turing in 1936 and John von Neumann some years later.Shedding new light on this crucial chapter in the history of science, The Great Formal Machinery Works is essential reading for students and researchers in logic, mathematics, and computer science.

Information technology --- Computers --- History. --- History.