Publication details

Saarland University Computer Science

Analytic Tableaux for Higher-Order Logic with Choice

Julian Backes, Chad E. Brown

Journal of Automated Reasoning 47(4):451-479, 2011

While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers so far have not. In order to support automated reasoning in the presence of a choice operator, we present a cut-free ground tableau calculus for Church’s simple type theory with choice. The tableau calculus is designed with automated search in mind. In particular, the rules only operate on the top level structure of formulas. Additionally, we restrict the instantiation terms for quantifiers to a universe that depends on the current branch. At base types the universe of instantiations is finite. We prove completeness of the tableau calculus relative to Henkin models.

Published Online at Springer on July 9, 2011.

Download PDF        Show BibTeX               

Login to edit

Legal notice, Privacy policy