ISSN:
1573-0670
Keywords:
Condensed detachment
;
combinator
;
combinatory logic
;
resolution, P-W
;
relevant logic
;
implication
;
types
;
formulas-as-types
;
D-completeness
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01880331
Permalink