A mechanization of sorted higher-order logic based on the resolution principle

Abstract

The usage of sorts in first-order automated deduction has brought greater conciseness of representation and a considerable gain in efficiency by reducing the search spaces involved. This suggests that sort information can be employed in higher-order theorem proving with similar results.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2010-02-07

Downloads
441 (#39,556)

6 months
1 (#1,027,696)

Historical graph of downloads
How can I increase my downloads?