Most aspects of our private and social lives—our safety, the integrity of the financial system, the functioning of utilities and other services, and national security—now depend on computing. But how can we know that this computing is trustworthy? In Mechanizing Proof, Donald MacKenzie addresses this key issue by investigating the interrelations of computing, risk, and mathematical proof over the last half century from the perspectives of history and sociology. His discussion draws on the technical literature of computer science and artificial intelligence and on extensive interviews with participants. MacKenzie argues that our culture now contains two ideals of proof: proof as traditionally conducted by human mathematicians, and formal, mechanized proof. He describes the systems constructed by those committed to the latter ideal and the many questions those systems raise about the nature of proof. He looks at the primary social influence on the development of automated proof—the need to predict the behavior of the computer systems upon which human life and security depend—and explores the involvement of powerful organizations such as the National Security Agency. He concludes that in mechanizing proof, and in pursuing dependable computer systems, we do not obviate the need for trust in our collective human judgment.

In Part II we study Herbrand's Theorem in Linear Logic and the No Counterexample Interpretation in a fragment of Peano Arithmetic (section 10). As an application to Ramsey Theory we give a parametric form of the Ramsey Theorem, that generalizes the Infinite, the Finite and the Ramsey-Paris-Harrington Theorems for a fixed exponent (sections 10-13)."

By presenting state-of-the-art results in logical reasoning and formal methods in the context of artificial intelligence and AI applications, this book commemorates the 60th birthday of Jörg H. Siekmann. The 30 revised reviewed papers are written by former and current students and colleagues of Jörg Siekmann; also included is an appraisal of the scientific career of Jörg Siekmann entitled "A Portrait of a Scientist: Logics, AI, and Politics." The papers are organized in four parts on logic and deduction, applications of logic, formal methods and security, and agents and planning.

This volume contains articles covering a broad spectrum of proof theory, with an emphasis on its mathematical aspects. The articles should not only be interesting to specialists of proof theory, but should also be accessible to a diverse audience, including logicians, mathematicians, computer scientists and philosophers. Many of the central topics of proof theory have been included in a self-contained expository of articles, covered in great detail and depth. The chapters are arranged so that the two introductory articles come first; these are then followed by articles from core classical areas of proof theory; the handbook concludes with articles that deal with topics closely related to computer science.

This book is a specialized monograph on the development of the mathematical and computational metatheory of reductive logic and proof-search, areas of logic that are becoming important in computer science. A systematic foundational text on these emerging topics, it includes proof-theoretic, semantic/model-theoretic and algorithmic aspects. The scope ranges from the conceptual background to reductive logic, through its mathematical metatheory, to its modern applications in the computational sciences. Suitable for researchers and graduate students in mathematical, computational and philosophical logic, and in theoretical computer science and artificial intelligence, this is the latest in the prestigous world-renowned Oxford Logic Guides, which contains Michael Dummet's Elements of intuitionism (2nd Edition), Dov M. Gabbay, Mark A. Reynolds, and Marcelo Finger's Temporal Logic Mathematical Foundations and Computational Aspects , J. M. Dunn and G. Hardegree's Algebraic Methods in Philosophical Logic, H. Rott's Change, Choice and Inference: A Study of Belief Revision and Nonmonotonic Reasoning , and P. T. Johnstone's Sketches of an Elephant: A Topos Theory Compendium: Volumes 1 and 2 .

An examination of the challenges of establishing the authenticity of electronic documents—in particular the design of a cryptographic equivalent to handwritten signatures. The gradual disappearance of paper and its familiar evidential qualities affects almost every dimension of contemporary life. From health records to ballots, almost all documents are now digitized at some point of their life cycle, easily copied, altered, and distributed. In Burdens of Proof, Jean-François Blanchette examines the challenge of defining a new evidentiary framework for electronic documents, focusing on the design of a digital equivalent to handwritten signatures. From the blackboards of mathematicians to the halls of legislative assemblies, Blanchette traces the path of such an equivalent: digital signatures based on the mathematics of public-key cryptography. In the mid-1990s, cryptographic signatures formed the centerpiece of a worldwide wave of legal reform and of an ambitious cryptographic research agenda that sought to build privacy, anonymity, and accountability into the very infrastructure of the Internet. Yet markets for cryptographic products collapsed in the aftermath of the dot-com boom and bust along with cryptography's social projects. Blanchette describes the trials of French bureaucracies as they wrestled with the application of electronic signatures to real estate contracts, birth certificates, and land titles, and tracks the convoluted paths through which electronic documents acquire moral authority. These paths suggest that the material world need not merely succumb to the virtual but, rather, can usefully inspire it. Indeed, Blanchette argues, in renewing their engagement with the material world, cryptographers might also find the key to broader acceptance of their design goals.

This radical, profoundly scholarly book explores the purposes and nature of proof in a range of historical settings. It overturns the view that the first mathematical proofs were in Greek geometry and rested on the logical insights of Aristotle by showing how much of that view is an artefact of nineteenth-century historical scholarship. It documents the existence of proofs in ancient mathematical writings about numbers and shows that practitioners of mathematics in Mesopotamian, Chinese and Indian cultures knew how to prove the correctness of algorithms, which are much more prominent outside the limited range of surviving classical Greek texts that historians have taken as the paradigm of ancient mathematics. It opens the way to providing the first comprehensive, textually based history of proof.