(Enter summary)
Abstract: 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 rst-order logic. To reach this goal, we establish classes of models that adequately
characterize the existing theorem-proving calculi and we present a standard methodology of
abstract consistency methods (by providing the necessary model existence theorems) needed
to analyze completeness of machine-oriented calculi... (Update)
Context of citations to this paper: More
...calculus presented in this paper. For the completeness proof we will use a model existence theorem (see theorem 1 below) established in [BK97] It is matter of folklore that equality can directly be expressed in HOL e.g. by the Leibniz definition, so that a primitive notion...
Cited by: More
Henkin Completeness of Higher-Order Resolution - Benzmüller, Kohlhase (1997)
(Correct)
Similar documents (at the sentence level):
18.8%: Equality and Extensionality in Automated Higher-Order Theorem.. - Benzmüller (1999)
(Correct)
Active bibliography (related documents): More All
1.5: Extensional Higher-Order Resolution - Benzmüller, Kohlhase (1998)
(Correct)
0.6: A Calculus and a System Architecture for Extensional.. - Benzmüller (1997)
(Correct)
0.6: HOT: A Concurrent Automated Theorem Prover based on Higher-Order.. - Konrad (1998)
(Correct)
Similar documents based on text: More All
0.3: Agent-Oriented Integration of Distributed Mathematical Services - Franke, Hess, al. (1999)
(Correct)
0.3: Higher-Order Automated Theorem Proving - Kohlhase (1998)
(Correct)
0.2: Unification in a Sorted λ-Calculus with Term Declarations .. - Kohlhase (1994)
(Correct)
Related documents from co-citation: More All
2: A Mechanization of Sorted Higher-Order Logic Based on the Resolution Principle (context) - Kohlhase - 1994
BibTeX entry: (Update)
Christoph Benzmuller and Michael Kohlhase. Model existence for higher-order logic. SEKIReport SR-97-09, Universitat des Saarlandes, 1997. http://citeseer.ist.psu.edu/benzmuller00model.html More
@misc{ benzmuller97model,
author = "C. Benzmuller and M. Kohlhase",
title = "Model existence for higher-order logic",
text = "Christoph Benzmuller and Michael Kohlhase. Model existence for higher-order
logic. SEKIReport SR-97-09, Universitat des Saarlandes, 1997.",
year = "1997",
url = "citeseer.ist.psu.edu/benzmuller00model.html" }
Citations (may not include all citations):
322
First-Order Logic and Automated Theorem Proving (context) - Fitting - 1990
251
A logic programming language with lambda-abstraction
- Miller - 1991
235
First-Order Logic (context) - Smullyan - 1968
151
An Introduction to Mathematical Logic and Type Theory: To Tr.. (context) - Andrews - 1986
101
Higher-order logic programming
- Nadathur, Miller - 1994
86
Completeness in the theory of types (context) - Henkin - 1950
72
North Holland (context) - Takeuti - 1987
52
TPS: A theorem proving system for classical type theory
- Andrews, Bishop et al. - 1996
42
Resolution in type theory (context) - Andrews - 1971
28
Proofs in Higher-Order Logic (context) - Miller - 1983
27
Constrained Resolution: A Complete Method for Higher Order L.. (context) - erard, Huet - 1972
27
Automating higher order logics (context) - Andrews, Longini-Cohen et al. - 1984
24
A Mechanization of Sorted Higher-Order Logic Based on the Re.. (context) - Kohlhase - 1994
23
Its Syntax and Semantics (context) - Barendregt, Calculus - 1984
22
Theoretical Computer Science (context) - Wolfram, for - 1994
21
A mechanization of type theory (context) - erard, Huet - 1973
19
Higher-Order Tableaux
- Kohlhase - 1995
16
Acta Philosophica Fennica (context) - Hintikka, content et al. - 1955
11
a higher-order theorem prover (context) - Benzm, Michael et al.
11
Automated Deduction { A Basis for Applications (context) - Bibel, Schmitt - 1998
9
General models and extensionality (context) - Andrews - 1972
8
Uber formal unentscheidbare Satze der Principia Mathematica.. (context) - odel - 1931
5
A calculus and a system architecture for extensional highero..
- Benzm - 1997
4
Lambda calculus notation with nameless dummies (context) - de Bruijn - 1972
4
Higher-order order-sorted resolution
- Kohlhase - 1994
4
Higher-order automated theorem proving
- Kohlhase
4
General models descriptions and choice in type theory (context) - Andrews - 1972
4
The discovery of my completeness proofs
- Henkin - 1996
4
order type theory (context) - Jensen, Pietrzykowski et al. - 1972
2
Model Existence for Higher-Order Logic
- Benzm, Michael - 1997
2
Equality and Extensionality in Automated Higher-Order Theore..
- Benzm - 1999
2
Extensional higher-order paramodulation and RUEresolution
- Benzm - 1999
1
Semantical and syntactical properties of simple type theory (context) - Sch - 1960
1
Letter to James Roger Hindley dated January 22 (context) - Andrews - 1973
1
A unifying principle for quantication theory (context) - Smullyan - 1963
1
Extensional higher-order resolution (context) - Benzm, Michael
1
Resolution for Henkin Models (context) - Benzm, Michael - 1997
1
Cut-elimination in simple type theory with extensionality (context) - Takahashi - 1968
Documents on the same site (http://www.ags.uni-sb.de/%7Ekohlhase/pubs.html): More
Higher-Order Automated Theorem Proving for Natural Language.. - Kohlhase, Konrad (1998)
(Correct)
LOmegaUI: Lovely OMEGA User Interface - Siekmann, Hess, Benzmüller.. (1998)
(Correct)
Dynamic Lambda Calculus - Kohlhase, Kuschert, Müller (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC