Kaiserslautern - Fachbereich Informatik
Refine
Year of publication
- 1997 (1)
Document Type
- Preprint (1)
Language
- English (1)
Has Fulltext
- yes (1)
Keywords
- automated theorem proving (1) (remove)
Faculty / Organisational entity
In this paper we provide a semantical meta-theory that will support the development of higher-order calculi for automated theorem proving like the corresponding methodology has in first-order logic. To reach this goal, we establish classes of models that adequately characterize the existing theorem-proving calculi, that is, so that they are sound and complete to these calculi, and a standard methodology of abstract consistency methods (by providing the necessary model existence theorems) needed to analyze completeness of machine-oriented calculi.