Skip to main content
Conference Proceedings

Optimized encodings of fragments of type theory in first order logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1158 LNCS 265-287
DOI: 10.1007/3-540-61780-9_75
8Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper presents sound and complete translations of several fragments of Martin-Löf 's monomorphic type theory to first order predicate calculus. The translations are optimised for the purpose of automated theorem proving in the mentioned fragments. The implementation of the theorem prover Gandalf and several experimental results are described.

Cite

CITATION STYLE

APA

Tammet, T., & Smith, J. M. (1996). Optimized encodings of fragments of type theory in first order logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1158 LNCS, pp. 265–287). https://doi.org/10.1007/3-540-61780-9_75

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free