Reasoning in extensional type theory with equality

Authors:
Chad E. Brown
Affiliations:
Universität des Saarlandes, Saarbrücken, Germany
Venue:
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Year:
2005

Citing 7
Cited 0

On connections and higher-order logic

Journal of Automated Reasoning
SET-VAR

Journal of Automated Reasoning
Introduction to Mathematical Logic and Type Theory: To Truth through Proof

Introduction to Mathematical Logic and Type Theory: To Truth through Proof
Solving for Set Variables in Higher-Order Theorem Proving

CADE-18 Proceedings of the 18th 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe methods for automated theorem proving in extensional type theory with primitive equality. We discuss a complete, cut-free sequent calculus as well as a compact representation of cut-free (ground) proofs as extensional expansion dags. Automated proof search can be realized using a few operations to manipulate extensional expansion dags with variables. These search operations form a basis for complete search procedures. Procedures based on these ideas are implemented in the higher-order theorem prover Tps.