A filter lambda model and the completeness of type assignment1

Publisher： Cambridge University Press

E-ISSN： 1943-5886|48|4|931-940

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.48, Iss.4, 1983-12, pp. : 931-940

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Completeness of transfinite evaluation in an extension of the lambda calculus

By  

The Journal of Symbolic Logic, Vol. 52, Iss. 1, 1987-03 ,pp. : 243-275

Cambridge University Press

Access to resources Recommend Favorite

Model completeness for trivial, uncountably categorical theories of Morley rank 1

By Dolich Alfred  

Archive for Mathematical Logic, Vol. 45, Iss. 8, 2006-11 ,pp. : 931-945

Springer Publishing Company

Access to resources Recommend Favorite

Projective model completeness

By  

The Journal of Symbolic Logic, Vol. 39, Iss. 1, 1974-03 ,pp. : 117-123

Cambridge University Press

Access to resources Recommend Favorite

Completeness in the theory of types 1

By  

The Journal of Symbolic Logic, Vol. 15, Iss. 2, 1950-06 ,pp. : 81-91

Cambridge University Press

Access to resources Recommend Favorite

A sequent calculus for type assignment

By  

The Journal of Symbolic Logic, Vol. 42, Iss. 1, 1977-03 ,pp. : 11-28

Cambridge University Press

Access to resources Recommend Favorite