Terminating Tableaux for the Basic Fragment of Simple Type Theory

Authors:
Chad E. Brown;Gert Smolka
Affiliations:
Saarland University, Saarbrücken, Germany;Saarland University, Saarbrücken, Germany
Venue:
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Year:
2009

Citing 7
Cited 2

Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)
Higher-Order Tableaux

TABLEAUX '95 Proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Extensional Higher-Order Paramodulation and RUE-Resolution

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

Handbook of automated reasoning
LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Automated Reasoning in Higher-order Logic: Set Comprehension and Extensionality in Church's Type Theory

Automated Reasoning in Higher-order Logic: Set Comprehension and Extensionality in Church's Type Theory
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic

Analytic Tableaux for Higher-Order Logic with Choice

Journal of Automated Reasoning
Analytic tableaux for higher-order logic with choice

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the basic fragment of simple type theory, which restricts equations to base types and disallows lambda abstractions and quantifiers. We show that this fragment has the finite model property and that satisfiability can be decided with a terminating tableau system. Both results are with respect to standard models.