Switch to: Citations

Add references

You must login to add references.
  1. Categorical semantics for higher order polymorphic lambda calculus.R. A. G. Seely - 1987 - Journal of Symbolic Logic 52 (4):969-989.
    A categorical structure suitable for interpreting polymorphic lambda calculus (PLC) is defined, providing an algebraic semantics for PLC which is sound and complete. In fact, there is an equivalence between the theories and the categories. Also presented is a definitional extension of PLC including "subtypes", for example, equality subtypes, together with a construction providing models of the extended language, and a context for Girard's extension of the Dialectica interpretation.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • Mathematical Logic as Based on the Theory of Types.Bertrand Russell - 1908 - American Journal of Mathematics 30 (3):222-262.
    Direct download  
     
    Export citation  
     
    Bookmark   278 citations  
  • The Generalised Type-Theoretic Interpretation of Constructive Set Theory.Nicola Gambino & Peter Aczel - 2006 - Journal of Symbolic Logic 71 (1):67 - 103.
    We present a generalisation of the type-theoretic interpretation of constructive set theory into Martin-Löf type theory. The original interpretation treated logic in Martin-Löf type theory via the propositions-as-types interpretation. The generalisation involves replacing Martin-Löf type theory with a new type theory in which logic is treated as primitive. The primitive treatment of logic in type theories allows us to study reinterpretations of logic, such as the double-negation translation.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • Foundations of Constructive Analysis.Errett Bishop - 1967 - New York, NY, USA: Mcgraw-Hill.
    This book, Foundations of Constructive Analysis, founded the field of constructive analysis because it proved most of the important theorems in real analysis by constructive methods. The author, Errett Albert Bishop, born July 10, 1928, was an American mathematician known for his work on analysis. In the later part of his life Bishop was seen as the leading mathematician in the area of Constructive mathematics. From 1965 until his death, he was professor at the University of California at San Diego.
    Direct download  
     
    Export citation  
     
    Bookmark   109 citations  
  • Can You Add Power‐Sets to Martin‐Lof's Intuitionistic Set Theory?Maria Emilia Maietti & Silvio Valentini - 1999 - Mathematical Logic Quarterly 45 (4):521-532.
    In this paper we analyze an extension of Martin-Löf s intensional set theory by means of a set contructor P such that the elements of P are the subsets of the set S. Since it seems natural to require some kind of extensionality on the equality among subsets, it turns out that such an extension cannot be constructive. In fact we will prove that this extension is classic, that is “ true holds for any proposition A.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  • Introduction to Higher Order Categorical Logic.J. Lambek & P. J. Scott - 1989 - Journal of Symbolic Logic 54 (3):1113-1114.
  • Intuitionist type theory and foundations.J. Lambek & P. J. Scott - 1981 - Journal of Philosophical Logic 10 (1):101 - 115.
    A version of intuitionistic type theory is presented here in which all logical symbols are defined in terms of equality. This language is used to construct the so-called free topos with natural number object. It is argued that the free topos may be regarded as the universe of mathematics from an intuitionist's point of view.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Functional completeness of cartesian categories.J. Lambek - 1974 - Annals of Mathematical Logic 6 (3):259.
  • A Formulation of the Simple Theory of Types.Alonzo Church - 1940 - Journal of Symbolic Logic 5 (3):114-115.
    Direct download  
     
    Export citation  
     
    Bookmark   140 citations  
  • Constructing Cantorian counterexamples.George Boolos - 1997 - Journal of Philosophical Logic 26 (3):237-239.
    Cantor's diagonal argument provides an indirect proof that there is no one-one function from the power set of a set A into A. This paper provides a somewhat more constructive proof of Cantor's theorem, showing how, given a function f from the power set of A into A, one can explicitly define a counterexample to the thesis that f is one-one.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • A theory of propositional types.Leon Henkin - 1963 - Fundamenta Mathematicae 52:323-334.
  • Choice Implies Excluded Middle.N. D. Goodman & J. Myhill - 1975 - Zeitschrift Fur Mathematische Logik Und Grundlaaen der Mathematik 24:461.
     
    Export citation  
     
    Bookmark   11 citations  
  • Locally cartesian closed categories and type theory.R. A. G. Seely - 1984 - Mathematical Proceedings of the Cambridge Philosophical Society 95 (1):33.
    No categories
     
    Export citation  
     
    Bookmark   18 citations  
  • Axiom of Choice and Complementation.Radu Diaconescu - 1975 - Proceedings of the American Mathematical Society 51 (1):176-178.
    It is shown that an intuitionistic model of set theory with the axiom of choice has to be a classical one.
    Direct download  
     
    Export citation  
     
    Bookmark   24 citations  
  • The law of excluded middle and the axiom of choice.W. W. Tait - 1994 - In Alexander George (ed.), Mathematics and Mind. Oxford University Press. pp. 45--70.
    Direct download  
     
    Export citation  
     
    Bookmark   12 citations  
  • General Theory of Natural Equivalences.Saunders MacLane & Samuel Eilenberg - 1945 - Transactions of the American Mathematical Society:231-294.
     
    Export citation  
     
    Bookmark   86 citations