Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)A Formulation of the Simple Theory of Types.Alonzo Church - 1940 - Journal of Symbolic Logic 5 (3):114-115.
    Download  
     
    Export citation  
     
    Bookmark   147 citations  
  • Introduction to Higher Order Categorical Logic.J. Lambek & P. J. Scott - 1989 - Journal of Symbolic Logic 54 (3):1113-1114.
    Download  
     
    Export citation  
     
    Bookmark   131 citations  
  • Higher-order semantics and extensionality.Christoph Benzmüller, Chad E. Brown & Michael Kohlhase - 2004 - Journal of Symbolic Logic 69 (4):1027-1088.
    In this paper we re-examine the semantics of classical higher-order logic with the purpose of clarifying the role of extensionality. To reach this goal, we distinguish nine classes of higher-order models with respect to various combinations of Boolean extensionality and three forms of functional extensionality. Furthermore, we develop a methodology of abstract consistency methods needed to analyze completeness of higher-order calculi with respect to these model classes.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Resolution in type theory.Peter B. Andrews - 1971 - Journal of Symbolic Logic 36 (3):414-432.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Über das Verhältnis zwischen intuitionistischer und klassischer Arithmetik.Gerhard Gentzen - 1974 - Archive for Mathematical Logic 16 (3-4):119-132.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • On second order intuitionistic propositional logic without a universal quantifier.Konrad Zdanowski - 2009 - Journal of Symbolic Logic 74 (1):157-167.
    We examine second order intuitionistic propositional logic, IPC². Let $F_\exists $ be the set of formulas with no universal quantification. We prove Glivenko's theorem for formulas in $F_\exists $ that is, for φ € $F_\exists $ φ is a classical tautology if and only if ¬¬φ is a tautology of IPC². We show that for each sentence φ € $F_\exists $ (without free variables), φ is a classical tautology if and only if φ is an intuitionistic tautology. As a corollary (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Inhabitation of polymorphic and existential types.Makoto Tatsuta, Ken-Etsu Fujita, Ryu Hasegawa & Hiroshi Nakano - 2010 - Annals of Pure and Applied Logic 161 (11):1390-1399.
    This paper shows that the inhabitation problem in the lambda calculus with negation, product, polymorphic, and existential types is decidable, where the inhabitation problem asks whether there exists some term that belongs to a given type. In order to do that, this paper proves the decidability of the provability in the logical system defined from the second-order natural deduction by removing implication and disjunction. This is proved by showing the quantifier elimination theorem and reducing the problem to the provability in (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations