A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A Complete Mechanization of Second-Order Type Theory
Journal of the ACM (JACM)
A complete mechanization of (&ohgr;) -order type theory
ACM '72 Proceedings of the ACM annual conference - Volume 1
Constrained resolution: a complete method for higher-order logic.
Constrained resolution: a complete method for higher-order logic.
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
Higher-order unification revisited: Complete sets of transformations
Journal of Symbolic Computation
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
A sequent calculus with implicit term representation
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Cut-simulation in impredicative logics
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
What do we know when we know that a theory is consistent?
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Higher-order aspects and context in SUMO
Web Semantics: Science, Services and Agents on the World Wide Web
| Hi-index | 0.00 |
A refutational system of logic for a language of order w ia presented . This langage is a slight modification of Church's -calculus with types. The system is complete, in the sense that a refutation of a set of sentences exists if and only if this set does not possess a general Henkin model. The main rule of inference is a generalization of Robinson's resolution to type theory, which allows us to get rid of the substitution rule.