Computation and Proof Theory

Arithmetic, Proof Theory, and Computatio

📁 Arithmetic, Proof Theory, and Computational Complexity

✍ Peter Clote, Jan Krajícek 📂 Library 📅 1993 🏛 Oxford University Press, USA 🌐 English

This book principally concerns the rapidly growing area of what might be termed "Logical Complexity Theory": the study of bounded arithmetic, propositional proof systems, length of proof, and similar themes, and the relations of these topics to computational complexity theory. Issuing from a two-ye

📁 Arithmetic, proof theory, and computational complexity

📂 Library 📅 1993 🏛 New York : Clarendon Press ; Oxford, Eng. ; New Yo 🌐 English

xii, 428 p. ; 25 cm

Proofs and algorithms: introduction to l

📁 Proofs and algorithms: introduction to logic and computability theory

✍ Dowek, Gilles 📂 Library 📅 2011 🏛 Springer 🌐 English

Proof and Computation

📁 Proof and Computation

✍ Ulrich Berger, Helmut Schwichtenberg (auth.), Helmut Schwichtenberg (eds.) 📂 Library 📅 1995 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

Logical concepts and methods are of growing importance in many areas of computer science. The proofs-as-programs paradigm and the wide acceptance of Prolog show this clearly. The logical notion of a formal proof in various constructive systems can be viewed as a very explicit way to describe a co

Reverse Mathematics: Problems, Reduction

📁 Reverse Mathematics: Problems, Reductions, and Proofs (Theory and Applications of Computability)

✍ Damir D. Dzhafarov, Carl Mummert 📂 Library 📅 2022 🏛 Springer 🌐 English

Reverse mathematics studies the complexity of proving mathematical theorems and solving mathematical problems. Typical questions include: Can we prove this result without first proving that one? Can a computer solve this problem? A highly active part of mathematical logic and computability

Reverse Mathematics: Problems, Reduction

📁 Reverse Mathematics: Problems, Reductions, and Proofs (Theory and Applications of Computability)

✍ Damir D. Dzhafarov, Carl Mummert 📂 Library 📅 2022 🏛 Springer 🌐 English

Reverse mathematics studies the complexity of proving mathematical theorems and solving mathematical problems. Typical questions include: Can we prove this result without first proving that one? Can a computer solve this problem? A highly active part of mathematical logic and computability

✦ Synopsis