Advances in Proof Theory

Reinhard Kahle, Thomas Strahm, Thomas Studer (Herausgeber)

Buch | Hardcover

XII, 425 Seiten

2016 | 1st ed. 2016
Springer International Publishing (Verlag)
978-3-319-29196-3 (ISBN)

Artikel merken

The aim of this volume is to collect original contributions by the best specialists from the area of proof theory, constructivity, and computation and discuss recent trends and results in these areas. Some emphasis will be put on ordinal analysis, reductive proof theory, explicit mathematics and type-theoretic formalisms, and abstract computations. The volume is dedicated to the 60th birthday of Professor Gerhard Jäger, who has been instrumental in shaping and promoting logic in Switzerland for the last 25 years. It comprises contributions from the symposium "Advances in Proof Theory", which was held in Bern in December 2013.

Proof theory came into being in the twenties of the last century, when it was inaugurated by David Hilbert in order to secure the foundations of mathematics. It was substantially influenced by Gödel's famous incompleteness theorems of 1930 and Gentzen's new consistency proof for the axiom system of first order number theory in 1936. Today, proof theory is a well-established branch of mathematical and philosophical logic and one of the pillars of the foundations of mathematics. Proof theory explores constructive and computational aspects of mathematical reasoning; it is particularly suitable for dealing with various questions in computer science.

W. Buchholz: A survey on ordinal notations around the Bachmann-Howard ordinal.- A. Cantini: About truth and types.- R. Dyckhoff: Intuitionistic decision procedures since Gentzen.- S. Feferman: The operational perspective.- R. Gore: Formally verified proof-theory using Isabelle/HOL.- P. Minari: Analytic equational proof systems for combinatory logic and lambda calculus.- W. Pohlers: From subsystems of classical analysis to subsystems of set theory - a personal account.- M. Rathjen: Ordinal analysis and witness extraction.- P. Schuster: Logic completeness via open induction.- H. Schwichtenberg: On the computational content of Higman's lemma.- P. Schroeder-Heister: TBA.- A. Setzer: TBA.- S. Wainer: On weak "pointwise" induction, and a miniaturized predicativity.

Erscheinungsdatum	28.04.2016
Reihe/Serie	Progress in Computer Science and Applied Logic
Zusatzinfo	XII, 425 p. 10 illus.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Gewicht	801 g
Themenwelt	Geisteswissenschaften ► Philosophie ► Logik
	Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika
	Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre
Schlagworte	Constructive Mathematics • Logic • Mathematical Logic and Foundations • mathematics and statistics • ordinal analysis • proof search • Proof theory • Type Theory
ISBN-10	3-319-29196-3 / 3319291963
ISBN-13	978-3-319-29196-3 / 9783319291963
Zustand	Neuware