Proof And Computation Ii From Proof Theory And Univalent Mathematics To Program Extraction And Verification

This book is for graduate students and researchers, introducing modern foundational research in mathematics, computer science, and philosophy from an interdisciplinary point of view. Its scope includes proof theory, constructive mathematics and type theory, univalent mathematics and point-free approaches to topology, extraction of certified programs from proofs, automated proofs in the automotive industry, as well as the philosophical and historical background of proof theory. By filling the gap between (under-)graduate level textbooks and advanced research papers, the book gives a scholarly account of recent developments and emerging branches of the aforementioned fields.

Calculi of temporal logic are widely used in modern computer science. The temporal organization of information flows in the different architectures of laptops, the Internet, or supercomputers would not be possible without appropriate temporal calculi. In the age of digitalization and High-Tech applications, people are often not aware that temporal logic is deeply rooted in the philosophy of modalities. A deep understanding of these roots opens avenues to the modern calculi of temporal logic which have emerged by extension of modal logic with temporal operators. Computationally, temporal operators can be introduced in different formalisms with increasing complexity such as Basic Modal Logic (BML), Linear-Time Temporal Logic (LTL), Computation Tree Logic (CTL), and Full Computation Tree Logic (CTL*). Proof-theoretically, these formalisms of temporal logic can be interpreted by the sequent calculus of Gentzen, the tableau-based calculus, automata-based calculus, game-based calculus, and dialogue-based calculus with different advantages for different purposes, especially in computer science.The book culminates in an outlook on trendsetting applications of temporal logics in future technologies such as artificial intelligence and quantum technology. However, it will not be sufficient, as in traditional temporal logic, to start from the everyday understanding of time. Since the 20th century, physics has fundamentally changed the modern understanding of time, which now also determines technology. In temporal logic, we are only just beginning to grasp these differences in proof theory which needs interdisciplinary cooperation of proof theory, computer science, physics, technology, and philosophy.

Driven by the question, 'What is the computational content of a (formal) proof?', this book studies fundamental interactions between proof theory and computability. It provides a unique self-contained text for advanced students and researchers in mathematical logic and computer science. Part I covers basic proof theory, computability and Gödel's theorems. Part II studies and classifies provable recursion in classical systems, from fragments of Peano arithmetic up to Π11–CA0. Ordinal analysis and the (Schwichtenberg–Wainer) subrecursive hierarchies play a central role and are used in proving the 'modified finite Ramsey' and 'extended Kruskal' independence results for PA and Π11–CA0. Part III develops the theoretical underpinnings of the first author's proof assistant MINLOG. Three chapters cover higher-type computability via information systems, a constructive theory TCF of computable functionals, realizability, Dialectica interpretation, computationally significant quantifiers and connectives and polytime complexity in a two-sorted, higher-type arithmetic with linear logic.

This book is for graduate students and researchers, introducing modern foundational research in mathematics, computer science, and philosophy from an interdisciplinary point of view. Its scope includes Predicative Foundations, Constructive Mathematics and Type Theory, Computation in Higher Types, Extraction of Programs from Proofs, and Algorithmic Aspects in Financial Mathematics. By filling the gap between (under-)graduate level textbooks and advanced research papers, the book gives a scholarly account of recent developments and emerging branches of the aforementioned fields. Contents: Proof and Computation (K Mainzer) Constructive Convex Programming (J Berger and G Svindland) Exploring Predicativity (L Crosilla) Constructive Functional Analysis: An Introduction (H Ishihara) Program Extraction (K Miyamoto) The Data Structures of the Lambda Terms (M Sato) Provable (and Unprovable) Computability (S Wainer) Introduction to Minlog (F Wiesnet) Readership: Graduate students, researchers, and professionals in Mathematics and Computer Science. Keywords: Proof Theory;Computability Theory;Program Extraction;Constructive Analysis;PredicativityReview: Key Features: This book gathers recent contributions of distinguished experts It makes emerging fields accessible to a wider audience, appealing to a broad readership with diverse backgrounds It fills a gap between (under-)graduate level textbooks and state-of-the-art research papers

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.

This book presents chapters exploring the most recent developments in the role of technology in proving. The full range of topics related to this theme are explored, including computer proving, digital collaboration among mathematicians, mathematics teaching in schools and universities, and the use of the internet as a site of proof learning. Proving is sometimes thought to be the aspect of mathematical activity most resistant to the influence of technological change. While computational methods are well known to have a huge importance in applied mathematics, there is a perception that mathematicians seeking to derive new mathematical results are unaffected by the digital era. The reality is quite different. Digital technologies have transformed how mathematicians work together, how proof is taught in schools and universities, and even the nature of proof itself. Checking billions of cases in extremely large but finite sets, impossible a few decades ago, has now become a standard method of proof. Distributed proving, by teams of mathematicians working independently on sections of a problem, has become very much easier as digital communication facilitates the sharing and comparison of results. Proof assistants and dynamic proof environments have influenced the verification or refutation of conjectures, and ultimately how and why proof is taught in schools. And techniques from computer science for checking the validity of programs are being used to verify mathematical proofs. Chapters in this book include not only research reports and case studies, but also theoretical essays, reviews of the state of the art in selected areas, and historical studies. The authors are experts in the field.