Order:
  1. On definition trees of ordinal recursive functonals: Reduction of the recursion orders by means of type level raising.Jan Terlouw - 1982 - Journal of Symbolic Logic 47 (2):395-402.
  2.  12
    Reduction of higher type levels by means of an ordinal analysis of finite terms.Jan Terlouw - 1985 - Annals of Pure and Applied Logic 28 (1):73-102.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  25
    Strong normalization in type systems: A model theoretical approach.Jan Terlouw - 1995 - Annals of Pure and Applied Logic 73 (1):53-78.
    Tait's proof of strong normalization for the simply typed λ-calculus is interpreted in a general model theoretical framework by means of the specification of a certain theory T and a certain model /oU of T. The argumentation is partly reduced to formal predicate logic by the application of certain derivability properties of T. The resulting version of Tait's proof is, within the same framework, systematically generalized to the Calculus of Constructions and other advanced type systems. The generalization proceeds along the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark