Abstraction and Application in Adjunction
| dc.creator | Dosen, K. | |
| dc.date | 2001-11-06 | |
| dc.date.accessioned | 2026-07-07T04:44:24Z | |
| dc.date.available | 2026-07-07T04:44:24Z | |
| dc.description | 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. | |
| dc.description | 15 pages | |
| dc.identifier | https://arxiv.org/abs/math/0111061 | |
| dc.identifier | http://arxiv.org/abs/math/0111061 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/62573 | |
| dc.subject | Category Theory | |
| dc.subject | Logic | |
| dc.subject | 18A15, 18A40, 18D15 | |
| dc.title | Abstraction and Application in Adjunction | |
| dc.type | text |