A structured set of higher-order problems

Authors:
Christoph E. Benzmüller;Chad E. Brown
Affiliations:
Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, Germany;Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, Germany
Venue:
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Year:
2005

Citing 14
Cited 4

Seventy-five problems for testing automatic theorem provers

Journal of Automated Reasoning
On connections and higher-order logic

Journal of Automated Reasoning
Higher-order unification revisited: Complete sets of transformations

Journal of Symbolic Computation
Solving Higher-Order Equations: From Logic to Programming

Solving Higher-Order Equations: From Logic to Programming
Introduction to Mathematical Logic and Type Theory: To Truth through Proof

Introduction to Mathematical Logic and Type Theory: To Truth through Proof
The TPTP Problem Library

Journal of Automated Reasoning
Higher-Order Tableaux

TABLEAUX '95 Proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
System Description: TPS: A Theorem Proving System for Type Theory

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
System Description: LEO - A Higher-Order Theorem Prover

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Classical type theory

Handbook of automated reasoning
Set comprehension in church's type theory

Set comprehension in church's type theory
The development of CASC

AI Communications - CASC
Problems and Experiments for and with Automated Theorem-Proving Programs

IEEE Transactions on Computers
Resolution, Refinements, and Search Strategies: A Comparative Study

IEEE Transactions on Computers

THF0 --- The Core of the TPTP Language for Higher-Order Logic

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Progress in the Development of Automated Theorem Proving for Higher-Order Logic

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Using the TPTP language for writing derivations and finite interpretations

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Extending the TPTP language to higher-order logic with automated parser generation

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as quick and easy criteria preceding the formal soundness and completeness analysis of proof systems under development. Our set of problems is structured according to different technical issues and along different notions of semantics (including Henkin semantics) for higher-order logic. Many examples are either theorems or non-theorems depending on the choice of semantics. The examples can thus indicate the deductive strength of a proof system.