Superposition for Higher-Order Logic

This monograph presents an extension of the superposition calculus to higher-order logic, also called simple type theory, and its implementation and empirical evaluation in an automated theorem prover.

The dissertation on which the volume is based won four prestigious honors: the Institute for Programming research and Algorithmics (IPA) dissertation award, the Bill McCune PhD Award in Automated Reasoning, the E.W. Beth Dissertation Prize, and the Ackermann Award. The book will be of value to researchers in the area of computer science logic, in particular those engaged with higher-order theorem proving.

Based on author's dissertation Thesis received four prestigious honors, including the E.W. Beth Dissertation Prize and the Ackermann Award Valuable for researchers in computer science logic, particularly designers of proof assistants

Klappentext

Inhalt

Introduction.- Preliminaries.- Superposition for Lambda-Free Higher-Order Logic.- The Embedding Path Order for Lambda-Free Higher-Order Terms.- Superposition with Lambdas.- Superposition with Interpreted Booleans.- Superposition for Full Higher-Order Logic.- Conclusion.- References.