Choose an application

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

This book verifies with compelling evidence the author’s intent to "write a book on proof theory that needs no previous knowledge of proof theory". Avoiding the cryptic terminology of proof theory as far as possible, the book starts at an elementary level and displays the connections between infinitary proof theory and generalized recursion theory, especially the theory of inductive definitions. As a "warm up" Gentzen's classical analysis of pure number theory is presented in a more modern terminology, followed by an explanation and proof of the famous result of Feferman and Schütte on the limits of predicativity. The author also provides an introduction to ordinal arithmetic, introduces the Veblen hierarchy and employs these functions to design an ordinal notation system for the ordinals below Epsilon 0 and Gamma 0, while emphasizing the first step into impredicativity, that is, the first step beyond Gamma 0. This is first done by an analysis of the theory of non-iterated inductive definitions using Buchholz’s improvement of local predicativity, followed by Weiermann's observation that Buchholz’s method can also be used for predicative theories to characterize their provably recursive functions. A second example presents an ordinal analysis of the theory of $/Pi_2$ reflection, a subsystem of set theory that is proof-theoretically equivalent to Kripke-Platek set. The book is pitched at undergraduate/graduate level, and thus addressed to students of mathematical logic interested in the basics of proof theory. It can be used for introductory as well as more advanced courses in proof theory. An earlier version of this book was published in 1989 as volume 1407 of the "Lecture Notes in Mathematics" (ISBN 978-3-540-51842-6).

Electronic books. -- local. --- Proof theory. --- Proof theory --- Mathematical Theory --- Mathematics --- Physical Sciences & Mathematics --- Mathematics. --- Mathematical logic. --- Operations research. --- Management science. --- Mathematical Logic and Foundations. --- Operations Research, Management Science. --- Quantitative business analysis --- Management --- Problem solving --- Operations research --- Statistical decision --- Operational analysis --- Operational research --- Industrial engineering --- Management science --- Research --- System theory --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Math --- Science --- Logic, Symbolic and mathematical --- Logic, Symbolic and mathematical.

Choose an application

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

Choose an application

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

Mathematical logic --- 517 --- Analysis --- Induction (Mathematics) --- Mathematical analysis --- Proof theory. --- Foundations. --- Induction (Mathematics). --- 517 Analysis --- Logique mathématique

Choose an application

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

A proof is a successful demonstration that a conclusion necessarily follows by logical reasoning from axioms which are considered evident for the given context and agreed upon by the community. It is this concept that sets mathematics apart from other disciplines and distinguishes it as the prototype of a deductive science. Proofs thus are utterly relevant for research, teaching and communication in mathematics and of particular interest for the philosophy of mathematics. In computer science, moreover, proofs have proved to be a rich source for already certified algorithms. This book provides the reader with a collection of articles covering relevant current research topics circled around the concept 'proof'. It tries to give due consideration to the depth and breadth of the subject by discussing its philosophical and methodological aspects, addressing foundational issues induced by Hilbert's Programme and the benefits of the arising formal notions of proof, without neglecting reasoning in natural language proofs and applications in computer science such as program extraction.

Proof theory. --- Mathematics. --- Logic, Symbolic and mathematical. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Math --- Science --- Logic, Symbolic and mathematical --- Mathematical Logic. --- Philosophy of Mathematics. --- Theoretical Computer Science.