Proof Theory and Automated Deduction: 6 (Applied Logic Series, 6) - Softcover

Goubault-Larrecq, Jean; Mackie, I.

Softcover

ISBN 10: 1402003684 ISBN 13: 9781402003684

Publisher: Springer, 2001

Synopsis

The last twenty years have witnessed an accelerated development of pure and ap­ plied logic, particularly in response to the urgent needs of computer science. Many traditional logicians have developed interest in applications and in parallel a new generation of researchers in logic has arisen from the computer science community. A new attitude to applied logic has evolved, where researchers tailor a logic for their own use in the same way they define a computer language, and where auto­ mated deduction for the logic and its fragments is as important as the logic itself. In such a climate there is a need to emphasise algorithmic logic methodologies alongside any individual logics. Thus the tableaux method or the resolution method are as central to todays discipline of logic as classical logic or intuitionistic logic are. From this point of view, J. Goubault and I. Mackie's book on Proof Theory and Automated Deduction is most welcome. It covers major algorithmic methodolo­ gies as well as a variety of logical systems. It gives a wide overview for the ap­ plied consumer of logic while at the same time remains relatively elementary for the beginning student. A decade ago I put forward my view that a logical system should be presented as a point in a grid. One coordinate is its philosphy, motivation, its accepted theorems and its required non-theorems. The other coordinate is the algorithmic methodol­ ogy and execution chosen for its effective presentation. Together these two aspects constitute a 'logic'.

About this title

Synopsis

"Proof Theory and Automated Deduction" is written for final-year undergraduate and first-year post-graduate students. It should also serve as a valuable reference for researchers in logic and computer science. It covers basic notions in logic, with a particular stress on proof theory, as opposed to, for example, model theory or set theory; and shows how they are applied in computer science, and especially the particular field of automated deduction, ie the automated search for proofs of mathematical propositions. We have chosen to give an in-depth analysis of the basic notions, instead of giving a mere sufficient analysis of basic and less basic notions. We often derive the same theorem by different methods, showing how different mathematical tools can be used to get at the very nature of the objects at hand, and how these tools relate to each other. Instead of presenting a linear collection of results, we have tried to show that all results and methods are tightly interwoven. We believe that understanding how to travel along this web of relations between concepts is more important than just learning the basic theorems and techniques by rote.

The book is a valuable reference for researchers in logic and computer science.

About the Author

Jean Goubault-Larrecq is Full Professor of Computer Science at the Ecole Normale Superieure de Cachan, France. He obtained his PhD in 1993 from the Ecole Polytechnique in the field of automated deduction, and since then he has led an active career in several fields of computer science: logic, computer security, semantics, domain theory, probabilistic and non-deterministic systems. He is currently heading team SECSI (security of information systems) at INRIA, France's national institute for research in computer science and control. He is the recipient of the 2011 CNRS Silver Medal in the field of computer science and its interactions. This is the highest scientific distinction in computer science in France.

Edition details

• Publisher: Springer
• Publication date: 2001
• Language: English
• ISBN 10: 1402003684
• ISBN 13: 9781402003684
• Binding: Paperback
• Number of pages: 444