The Maximality of the Typed Lambda Calculus and of Cartesian Closed Categories
Kosta Dosen, Zoran Petric
Abstract
From the analogue of Boehm's Theorem proved for the typed lambda calculus, without product types and with them, it is inferred that every cartesian closed category that satisfies an equality between arrows not satisfied in free cartesian closed categories must be a preorder. A new proof is given here of these results, which were obtained previously by Richard Statman and Alex K. Simpson.
Create a lesson
Related papers
Failure of Higher-Order Truth within Intuitionistic Propositional Logic
Lingyuan Ye, Yiqi Xu
Finitistic dimensions in triangulated categories with a compact silting generator
Xiaoyan Yang
De Morgan's Laws in Tensor-Triangular Geometry
Mark Lyttle
Absolute colimits
Richard Garner, Ross Street
A Categorical Framework for the Direct Integration of Banach Spaces
Daniel Funck, Giacomo Gavelli
The Cofree Functor on G-Sets and Its Approximations
Frank Murphy-Hernandez