Name
Abstract | ||
|---|---|---|
Abstract This paper studies ‘Fool's models’ of combinatory logic, and relates them to Hindley's ‘D-completeness’ problem. A ‘fool's model’ is a family of sets of → formulas, closed under condensed detachment. Alternatively, it is a ‘model’ ofCL in naive set theory. We examine Resolution; and the P-W problem. A sequel shows T→ is D-complete; also, its extensions. We close with an implementation FMO of these ideas. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1007/BF01880331 | Journal of Automated Reasoning |
Keywords | Field | DocType |
Condensed detachment,combinator,combinatory logic,resolution,P-W,relevant logic,implication,types,formulas-as-types,D-completeness | Family of sets,Combinatory logic,Algorithm,Condensed detachment,Relevance logic,Mathematics,Naive set theory | Journal |
Volume | Issue | ISSN |
7 | 4 | 1573-0670 |
Citations | PageRank | References |
7 | 1.03 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert K. Meyer | 1 | 172 | 40.52 |
| Martin W. Bunder | 2 | 64 | 16.78 |
| Lawrence Powers | 3 | 7 | 1.37 |