Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-22T05:56:36.974Z Has data issue: false hasContentIssue false

Failure of Cartesian closedness in NF

Published online by Cambridge University Press:  12 March 2014

Colin McLarty*
Affiliation:
Department of Philosophy, Case Western Reserve University, Cleveland, Ohio 44106

Extract

On any reasonable definition of functions, neither the category of sets nor the category of small categories is cartesian closed in New Foundations (NF). The latter category is sometimes proposed as a foundation for category theory since it is among its own objects. Our result shows it is a poor one.

In NF, as in other set theories, a "function" f from a set A to a set B is defined to be a set f of ordered pairs 〈x, y〉 with x in A and y in B, such that (a) if 〈x, y〉 ∈ f and 〈x, y′〉 ∈ f then y = y′, and (b) for every x in A there is some y in B with 〈x, y〉 ∈ f. But in NF different definitions of ordered pairs give significantly different functions. I say a reasonable definition must give:

1. The formula z = 〈x, y〉 is stratifiable.

2. For every set S there is a set {〈x, x〉 ∣ xS}.

3. If f is a function from A to B, and g one from B to C, there is a set {〈x, z〉∣(∃y)〈x, y〉∈ f & 〈y, z〉∈ g}.

Principles 2 and 3 are needed for identity functions and composites. By principle 1, any sets A and B have a set A × B of all ordered pairs 〈x, y〉 with x in A and y in B, but it does not follow that functions exist making A × B a categorical product of A and B.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)