Leseprobe
* Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.
The Great Formal Machinery Works
Jan von Plato
* Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.
Naturwissenschaften, Medizin, Informatik, Technik / Naturwissenschaften allgemein
Beschreibung
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.
Kundenbewertungen
Entscheidungsproblem, Mathematical induction, Prime number, Inference, Turing machine, Logical conjunction, Theorem, Natural number, Hilbert's program, Principia Mathematica, Logic, Sequent calculus, Intuitionism, Tautology (logic), Quantifier (logic), Logical consequence, Existential instantiation, Special case, Logical disjunction, Classical logic, Direct proof, Universal instantiation, Existential quantification, Notation, Well-formed formula, Formal language, Conjunctive normal form, Verificationism, Equation, Predicate (mathematical logic), Deduction theorem, Natural deduction, Wilhelm Ackermann, Associative property, Gentzen's consistency proof, Recursive definition, Begriffsschrift, Definable set, Proof theory, Addition, Scientific notation, Logical connective, Real number, Admissible rule, Peano axioms, Propositional calculus, Formal proof, Negation, Higher-order logic, Computation, Rule of inference, Sequent, Commutative property, Herbrand's theorem, Logicism, Formal science, Intuitionistic logic, Mathematics, Formal system, Axiom, Finitary, Axiomatic system, Decidability (logic), Logical reasoning, Consistency, Modal logic, Provability logic, Big O notation, Gottlob Frege, Predicate logic