Proof and Computation

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 expertsIt makes emerging fields accessible to a wider audience, appealing to a broad readership with diverse backgroundsIt fills a gap between (under-)graduate level textbooks and state-of-the-art research papers