Automated deduction by theory resolution
Journal of Automated Reasoning
An introduction to mathematical logic and type theory: to truth through proof
An introduction to mathematical logic and type theory: to truth through proof
A Λ-unifiability test for set theory
Journal of Automated Reasoning
Higher-order unification via combinators
Theoretical Computer Science
Combinatory reduction systems: introduction and survey
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Lambda-calculus, Combinators and the Comprehension Scheme
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Proof Normalization for a First-Order Formulation of Higher-Order Logic
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
HOL-lambdasigma: An Intentional First-Order Expression of Higher-Order Logic
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
Constrained resolution: a complete method for higher-order logic.
Constrained resolution: a complete method for higher-order logic.
A mechanization of type theory
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
| Hi-index | 0.00 |
Resolution modulo is a first-order theorem proving method that can be applied both to first-order presentations of simple type theory (also called higher-order logic) and to set theory. When it is applied to some first-order presentations of type theory, it simulates exactly higher-order resolution. In this note, we compare how it behaves on type theory and on set theory