You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Some of our earliest experiences of the conclusive force of an argument come from school mathematics: faced with a mathematical proof, we cannot deny the conclusion once the premises have been accepted. Behind such arguments lies a more general pattern of 'demonstrative arguments' that is studied in the science of logic. Logical reasoning is applied at all levels, from everyday life to advanced sciences, and a remarkable level of complexity is achieved in everyday logical reasoning, even if the principles behind it remain intuitive. Jan von Plato provides an accessible but rigorous introduction to an important aspect of contemporary logic: its deductive machinery. He shows that when the forms of logical reasoning are analysed, it turns out that a limited set of first principles can represent any logical argument. His book will be valuable for students of logic, mathematics and computer science.
In this book the author charts the history and development of modern probability theory.
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 pr...
A concise introduction to structural proof theory, a branch of logic studying the general structure of logical and mathematical proofs.
This book continues from where the authors' previous book, Structural Proof Theory, ended. It presents an extension of the methods of analysis of proofs in pure logic to elementary axiomatic systems and to what is known as philosophical logic. A self-contained brief introduction to the proof theory of pure logic is included that serves both the mathematically and philosophically oriented reader. The method is built up gradually, with examples drawn from theories of order, lattice theory and elementary geometry. The aim is, in each of the examples, to help the reader grasp the combinatorial behaviour of an axiom system, which typically leads to decidability results. The last part presents, as an application and extension of all that precedes it, a proof-theoretical approach to the Kripke semantics of modal and related logics, with a great number of new results, providing essential reading for mathematical and philosophical logicians.
Paris of the year 1900 left two landmarks: the Tour Eiffel, and David Hilbert's celebrated list of twenty-four mathematical problems presented at a conference opening the new century. Kurt Gödel, a logical icon of that time, showed Hilbert's ideal of complete axiomatization of mathematics to be unattainable. The result, of 1931, is called Gödel's incompleteness theorem. Gödel then went on to attack Hilbert's first and second Paris problems, namely Cantor's continuum problem about the type of infinity of the real numbers, and the freedom from contradiction of the theory of real numbers. By 1963, it became clear that Hilbert's first question could not be answered by any known means, half of...
Gerhard Gentzen (1909-1945) is the founder of modern structural proof theory. His lasting methods, rules, and structures resulted not only in the technical mathematical discipline called ''proof theory'' but also in verification programs that are essential in computer science. The appearance, clarity, and elegance of Gentzen's work on natural deduction, the sequent calculus, and ordinal proof theory continue to be impressive even today. The present book gives the first comprehensive, detailed, accurate scientific biography expounding the life and work of Gerhard Gentzen, one of our greatest logicians, until his arrest and death in Prague in 1945. Particular emphasis in the book is put on the...
In the summer of 1928, Kurt Gödel (1906–1978) embarked on his logical journey that would bring him world fame in a mere three years. By early 1929, he had solved an outstanding problem in logic, namely the question of the completeness of the axioms and rules of quantificational logic. He then went on to extend the result to the axiom system of arithmetic but found, instead of completeness, his famous incompleteness theorem that got published in 1931. It belongs to the most iconic achievements of 20th century science and has been instrumental in the development of theories of formal languages and algorithmic computability – two essential components in the birth of the information society...
During World War II at least 13.5 million people were employed as forced labourers in Germany and across the territories occupied by the German Reich. Most came from Russia, Ukraine, Belarus, Moldavia, the Baltic countries, France, Poland and Italy. Among them were 8.4 million civilians working for private companies and public agencies in industry, administration and agriculture. In addition, there were 4.6 million prisoners of war and 1.7 million concentration camp prisoners who were either subjected to forced labour in concentration or similar camps or were ‘rented out’ or sold by the SS. While there are numerous publications on forced labour in National Socialist Germany during World War II, this publication combines a historical account of events with the biographies and memories of former forced labourers from twenty-seven countries, offering a comparative international perspective.
Gerhard Gentzen has been described as logic’s lost genius, whom Gödel called a better logician than himself. This work comprises articles by leading proof theorists, attesting to Gentzen’s enduring legacy to mathematical logic and beyond. The contributions range from philosophical reflections and re-evaluations of Gentzen’s original consistency proofs to the most recent developments in proof theory. Gentzen founded modern proof theory. His sequent calculus and natural deduction system beautifully explain the deep symmetries of logic. They underlie modern developments in computer science such as automated theorem proving and type theory.