You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
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 is the first of two volumes comprising the papers submitted for publication by the invited participants to the Tenth International Congress of Logic, Methodology and Philosophy of Science, held in Florence, August 1995. The Congress was held under the auspices of the International Union of History and Philosophy of Science, Division of Logic, Methodology and Philosophy of Science. The invited lectures published in the two volumes demonstrate much of what goes on in the fields of the Congress and give the state of the art of current research. The two volumes cover the traditional subdisciplines of mathematical logic and philosophical logic, as well as their interfaces with computer science, linguistics and philosophy. Philosophy of science is broadly represented, too, including general issues of natural sciences, social sciences and humanities. The papers in Volume One are concerned with logic, mathematical logic, the philosophy of logic and mathematics, and computer science.
This thesis presents a completely automatic verification framework to check safety properties of parameterized systems. A parameterized system is a family of finite state systems where every system consists of a finite number of processes running in parallel the same algorithm. All the systems in the family differ only in the number of the processes and, in general, the number of systems in a family may be unbounded. Examples of parameterized systems are communication protocols, mutual exclusion protocols, cache coherence protocols, distributed algorithms etc. Model-checking of finite state systems is a well-developed formal verification approach of proving properties of systems in an automa...
Recent developments in computer science clearly show the need for a better theoretical foundation for some central issues. Methods and results from mathematical logic, in particular proof theory and model theory, are of great help here and will be used much more in future than previously. This book provides an excellent introduction to the interplay of mathematical logic and computer science. It contains extensively reworked versions of the lectures given at the 1997 Marktoberdorf Summer School by leading researchers in the field. Topics covered include: proof theory and specification of computation (J.-Y. Girard, D. Miller), complexity of proofs and programs (S. R. Buss, S. S. Wainer), computational content of proofs (H. Schwichtenberg), constructive type theory (P. Aczel, H. Barendregt, R. L. Constable), computational mathematics, (U. Martin), rewriting logic (J. Meseguer), and game semantics (S. Abramski).
Commemorating the 50th anniversary of the first time a mathematical theorem was proven by a computer system, Freek Wiedijk initiated the present book in 2004 by inviting formalizations of a proof of the irrationality of the square root of two from scientists using various theorem proving systems. The 17 systems included in this volume are among the most relevant ones for the formalization of mathematics. The systems are showcased by presentation of the formalized proof and a description in the form of answers to a standard questionnaire. The 17 systems presented are HOL, Mizar, PVS, Coq, Otter/Ivy, Isabelle/Isar, Alfa/Agda, ACL2, PhoX, IMPS, Metamath, Theorema, Leog, Nuprl, Omega, B method, and Minlog.
This book on proof theory centers around the legacy of Kurt Schütte and its current impact on the subject. Schütte was the last doctoral student of David Hilbert who was the first to see that proofs can be viewed as structured mathematical objects amenable to investigation by mathematical methods (metamathematics). Schütte inaugurated the important paradigm shift from finite proofs to infinite proofs and developed the mathematical tools for their analysis. Infinitary proof theory flourished in his hands in the 1960s, culminating in the famous bound Γ0 for the limit of predicative mathematics (a fame shared with Feferman). Later his interests shifted to developing infinite proof calculi f...
Per Martin-Löf's work on the development of constructive type theory has been of huge significance in the fields of logic and the foundations of mathematics. It is also of broader philosophical significance, and has important applications in areas such as computing science and linguistics. This volume draws together contributions from researchers whose work builds on the theory developed by Martin-Löf over the last twenty-five years. As well as celebrating the anniversary of the birth of the subject it covers many of the diverse fields which are now influenced by type theory. It is an invaluable record of areas of current activity, but also contains contributions from N. G. de Bruijn and William Tait, both important figures in the early development of the subject. Also published for the first time is one of Per Martin-Löf's earliest papers.
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 c...
This book contains the refereed proceedings of the 20th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2007, held in Kaiserslautern, Germany, September 2007. Among the topics of this volume are formal semantics of specification, modeling, and programming languages, specification and verification of hardware and software, formalization of mathematical theories, advances in theorem prover technology, as well as industrial application of theorem provers.