Switch to: Citations

Add references

You must login to add references.
  1. A natural extension of natural deduction.Peter Schroeder-Heister - 1984 - Journal of Symbolic Logic 49 (4):1284-1300.
    The framework of natural deduction is extended by permitting rules as assumptions which may be discharged in the course of a derivation. this leads to the concept of rules of higher levels and to a general schema for introduction and elimination rules for arbitrary n-ary sentential operators. with respect to this schema, (functional) completeness "or", "if..then" and absurdity is proved.
    Download  
     
    Export citation  
     
    Bookmark   100 citations  
  • On the strength of dependent products in the type theory of Martin-Löf.Richard Garner - 2009 - Annals of Pure and Applied Logic 160 (1):1-12.
    One may formulate the dependent product types of Martin-Löf type theory either in terms of abstraction and application operators like those for the lambda-calculus; or in terms of introduction and elimination rules like those for the other constructors of type theory. It is known that the latter rules are at least as strong as the former: we show that they are in fact strictly stronger. We also show, in the presence of the identity types, that the elimination rule for dependent (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • (1 other version)Intensional interpretations of functionals of finite type I.W. W. Tait - 1967 - Journal of Symbolic Logic 32 (2):198-212.
    Download  
     
    Export citation  
     
    Bookmark   50 citations  
  • A general formulation of simultaneous inductive-recursive definitions in type theory.Peter Dybjer - 2000 - Journal of Symbolic Logic 65 (2):525-549.
    The first example of a simultaneous inductive-recursive definition in intuitionistic type theory is Martin-Löf's universe á la Tarski. A set U 0 of codes for small sets is generated inductively at the same time as a function T 0 , which maps a code to the corresponding small set, is defined by recursion on the way the elements of U 0 are generated. In this paper we argue that there is an underlying general notion of simultaneous inductive-recursive definition which is (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Λ-definable functionals andβη conversion.R. Statman - 1983 - Archive for Mathematical Logic 23 (1):21-26.
    Download  
     
    Export citation  
     
    Bookmark   8 citations