Scott's models and illative combinatory logic

Scott's model Φoo for pure combinatory logic (see [8]) satisfies all these properties, but his graph model in [10] does not satisfy (77) (or (ζ)), (ξ) is satisfied but Scott seems to have some doubt about it. In [7] where Kleene sets up a formal system in which intuitionistic mathematics can be developed, (ξ) and (77) are not used. Kleene defines λuX only if X is a " te rm", λuX is then a "functor" (which is not a term). In his formal system equality is defined only over terms so that (ξ) and (77) are meaningless.

[1]  Martin W. Bunder Some notes on: "A deduction theorem for restricted generality" , 1976, Notre Dame J. Formal Log..

[2]  Martin W. Bunder,et al.  A deduction theorem for restricted generality , 1973, Notre Dame J. Formal Log..

[3]  Martin W. Bunder Propositional and predicate calculuses based on combinatory logic , 1974, Notre Dame J. Formal Log..

[4]  Martin W. Bunder Various systems of set theory based on combinatory logic , 1974, Notre Dame J. Formal Log..

[5]  Dana S. Scott,et al.  Combinators and classes , 1975, Lambda-Calculus and Computer Science Theory.

[6]  Robert K. Meyer,et al.  On the inconsistency of systems similar to , 1978 .

[7]  D. Scott Models for Various Type-Free Calculi , 1973 .

[8]  Dana S. Scott,et al.  Data Types as Lattices , 1976, SIAM J. Comput..