@MISC{01abstractionand,
author = {},
title = {Abstraction and Application in},
year = {2001}
}
The postulates of comprehension and extensionality in set theory are based on an inversion principle connecting set-theoretic abstraction and the property of having a member. An exactly analogous inversion principle connects functional abstraction and application to an argument in the postulates of the lambda calculus. Such an inversion principle arises also in two adjoint situations involving a cartesian closed category and its polynomial extension. Composing these two adjunctions, which stem from the deduction theorem of logic, produces the adjunction connecting product and exponentiation, i.e. conjunction and implication. Mathematics Subject Classification: 18A15, 18A40, 18D15 1
| 816 | S.: Categories for the working mathematician - Lane - 1998 |
| 123 | Introduction to Higher-Order Categorical Logic - Lambek, Scott - 1986 |
| 8 | Embedding of a free cartesian closed category into the category of sets - Čubrić - 1998 |
| 8 | Fibrations with indeterminates: Contextual and functional completeness for polymorphic lambda calculi - Hermida, Jacobs - 1995 |
| 7 | Functional completeness of cartesian categories - Lambek - 1974 |
| 3 | Modal Logic as Metalogic - Doˇsen - 1992 |
| 3 | Deductive systems and categories III: Cartesian closed categories, intuitionist propositional calculus, and combinatory logic - LAMBEK - 1972 |
| 2 | Modal functional completeness - Dosen, Petric - 1996 |
| 1 | Deductive completeness, Bull. Symbolic Logic 2 - Doˇsen - 1996 |
| 1 | Definitions of adjunction, in: W.A. Carnielli and I.M.L. D’Ottaviano eds - Doˇsen - 1999 |
Developed at and hosted by The College of Information Sciences and Technology
© 2007-2010 The Pennsylvania State University
