Analytic Tableaux for Higher-Order Logic with Choice

While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting 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.

[1]  Gert Smolka,et al.  Analytic Tableaux for Simple Type Theory and its First-Order Fragment , 2010 .

[2]  C. E. Brown.  Automated Reasoning in Higher-Order Logic: Set Comprehension and Extensionality in Church's Type Theory , 2007 .

[3]  R. Smullyan.  First-Order Logic , 1968 .

[4]  Peter B. Andrews,et al.  TPS: A hybrid automatic-interactive system for developing proofs , 2006, J. Appl. Log..

[5]  Leon Henkin,et al.  Completeness in the theory of types , 1950, Journal of Symbolic Logic.

[6]  Gert Smolka,et al.  Terminating Tableaux for the Basic Fragment of Simple Type Theory , 2009, TABLEAUX.

[7]  Peter B. Andrews.  General models and extensionality , 1972, Journal of Symbolic Logic.

[8]  Grigori Mints.  Cut-Elimination for Simple Type Theory with An Axiom of Choice , 1999, J. Symb. Log..

[9]  Gérard Huet,et al.  Constrained resolution: a complete method for higher-order logic. , 1972 .

[10]  Gert Smolka,et al.  Complete Cut-Free Tableaux for Equational Simple Type Theory , 2009 .

[11]  Peter B. Andrews.  Resolution in type theory , 1971, Journal of Symbolic Logic.

[12]  Geoff Sutcliffe,et al.  Progress in the Development of Automated Theorem Proving for Higher-Order Logic , 2009, CADE.

[13]  John C. Mitchell,et al.  Labeling techniques and typed fixed-point operators , 1999 .

[14]  Dale A. Miller,et al.  A compact representation of proofs , 1987, Stud Logica.

[15]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[16]  Christoph Benzmüller,et al.  Cut-Simulation and Impredicativity , 2009, Log. Methods Comput. Sci..

[17]  Christoph Benzmüller,et al.  Higher-order semantics and extensionality , 2004, Journal of Symbolic Logic.

[18]  Lawrence C. Paulson,et al.  LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description) , 2008, IJCAR.

[19]  M. Gordon,et al.  Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[20]  Gert Smolka,et al.  Extended First-Order Logic , 2009, TPHOLs.