Skip to main content

Enriched Stratified Systems for the Foundations of Category Theory

  • Chapter
  • First Online:

Part of the book series: The Western Ontario Series in Philosophy of Science ((WONS,volume 76))

Abstract

This is the fourth in a series of intermittent papers on the foundations of category theory stretching back over more than 35 years. The first three were “Set-theoretical foundations of category theory” (1969), “Categorical foundations and foundations of category theory” (1977), and much more recently, “Typical ambiguity: Trying to have your cake and eat it too” (2004). The present paper summarizes the results from a long (in two senses) unpublished manuscript,“Some formal systems for the unlimited theory of structures and categories” (1974), referred to below simply as “Unlimited”. That MS can be found in full on my home page at http://math.stanford.edu/ feferman/papers/Unlimited.pdf; the lengthy proof of its main consistency result is omitted here but the methods involved are outlined briefly in the Appendix below.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    See, for example, my collection of essays, In the Light of Logic (Feferman, 1998).

  2. 2.

    Bénabou (1985) proposes more specific requirements which need to be considered for a full scale foundation of naïve category theory.

  3. 3.

    Though inaccessible cardinals are not met in ordinary mathematical practice, working set-theorists accept their existence without hesitation as constituting a natural extension of the ZFC axioms, and indeed as only the first in a series of progressively stronger extensions. Gödel (1947) was an early proponent of this idea.

  4. 4.

    Just one universe of this kind is assumed in my 1969 paper; that is all one needs for the applications. In the 2004 paper, I assumed a sequence of such universes \(U_n \in U_{n+1}\) for each \(n \in \omega\), in order to relate the idea more directly to Russell’s idea of typical ambiguity.

  5. 5.

    Lower case letters will also be used for classes in some contexts below.

  6. 6.

    Actually, NFU is quite weak, proof-theoretically, compared to PA (Solovay, unpublished). As shown by Enayat (2004), one can obtain an extension of NFU equivalent in strength to PA by adding “every set is finite” and “every Cantorian set is strongly Cantorian” as axioms (cf. the final section below for the notions of Cantorian and strongly Cantorian sets in the framework of NFU).

  7. 7.

    Independently, Holmes (1991) showed that NFUp is interpretable in NFU + Inf, giving a more direct proof of Theorem 1 assuming Jensen’s work.

  8. 8.

    As in Mac Lane (1971) we use lower-case letters \(f, g, h, \ldots\) for morphisms in an abstract category, but this does not signal a new kind of variable in NFUp. Similarly, in the next section, where we use \(a, b, \ldots\) for objects in a category and η for natural transformations.

  9. 9.

    In the syntax of S* lower case letters are now used only in this way.

  10. 10.

    This has been suggested to me by Randall Holmes.

  11. 11.

    An axiom stating that all sets are Cantorian was first studied by Henson (1973). A related “axiom of counting” was introduced by Rosser (1953) in order to develop a smooth theory of finite cardinals in NF. It states that the set of finite cardinals is strongly Cantorian; that set is Cantorian in NF and in NFU + Infinity. (I am indebted to Ali Enayat for this background information.)

References

  • Bénabou, J. (1985) Fibered Categories and the Foundations of Naive Category Theory, Journal of Symbolic Logic 50, 10–37.

    Article  MathSciNet  MATH  Google Scholar 

  • Ehrenfeucht, A and Mostowski, A. (1956) Models of Axiomatic Theories Admitting Automorphisms, Fundamenta Mathematicae 43, 50–68.

    MathSciNet  MATH  Google Scholar 

  • Enayat, A. (2004) Automorphisms, Mahlo cardinals, and NFU, in Enayat, A. and Kossak, R., eds. Nonstandard Models of Arithmetic and Set Theory, Contemporary Mathematics, Vol. 361, Providence, RI: American Mathematical Society.

    Google Scholar 

  • Enayat, A. (2006) From bounded arithmetic to second order arithmetic via automorphisms, in Logic in Tehran, Notes in Logic 26, Association for Symbolic Logic (Urbana, IL); Natick, MA: A.K. Peters, Ltd.

    Google Scholar 

  • Erdös, P. and Rado, R. (1956) A Partition Calculus for Set Theory, Bulletin of the American Mathematical Society 62, 427–488.

    Article  MathSciNet  MATH  Google Scholar 

  • Feferman, S. (1969) Set-Theoretical Foundations for Category Theory (with an appendix by G. Kreisel), in Barr, M. et al., eds., Reports of the Midwest Category Seminar III, Lecture Notes in Mathematics 106, 201–247.

    Google Scholar 

  • Feferman, S. (1974) Some formal systems for the unlimited theory of structures and categories. Unpublished MS, available online at http://math.stanford.edu/~feferman/papers/Unlimited.pdf, Abstract in Journal of Symbolic Logic 39 (1974), 374–375.

    Google Scholar 

  • Feferman, S. (1977) Categorical Foundations and Foundations of Category Theory, in Butts, R. and Hintikka, J., eds., Logic, Foundations of Mathematics and Computability Theory, Vol. 1, Dordrecht: Reidel, pp. 149–165.

    Google Scholar 

  • Feferman, S. (1998) In the Light of Logic, Oxford: Oxford University Press.

    MATH  Google Scholar 

  • Feferman, S. (2004) Typical Ambiguity: Trying to Have Your Cake and Eat It Too, in Link,G., ed., One Hundred Years of Russell’s Paradox, Berlin: de Gruyter, pp. 135–151.

    Google Scholar 

  • Forster, T.E. (1995) Set Theory with a Universal Set, Oxford: Clarendon Press.

    MATH  Google Scholar 

  • Gabriel, P. (1962) Des catégories abéliennes, Bull. Soc. Math. France 90, 323–448.

    MathSciNet  MATH  Google Scholar 

  • Gödel, K. (1947) What is Cantor’s continuum problem?, The American Mathematical Monthly 54, 515–525; errata 55, 151; reprinted in Gödel, K., Collected Works, Vol. 2 (1990), 176–187, along with its revised 1964 version, 254–270.

    Article  MathSciNet  Google Scholar 

  • Hellman, G. (2003) Does category theory provide a framework for Mathematical structuralism?, Philosophia Mathematica 11, 129–157.

    Article  MathSciNet  MATH  Google Scholar 

  • Henson, W. (1973) Type-raising operations on cardinals and ordinals in Quine’s ‘New Foundations’, Journal of Symbolic Logic 39, 59–68.

    Article  MathSciNet  Google Scholar 

  • Holmes, M.R. (1991) The axiom of anti-foundation in Jensen’s ‘New Foundations with Ur-elements’, Bull. de la Soc. Math. de Belgique (serie B) 43, 167–191.

    MATH  Google Scholar 

  • Holmes, M.R. (1998) Elementary Set Theory with a Universal Set, Vol. 10 of the Cahiers du Centre de logique, Louvain-la-Neuve (Belgium): Academia. Corrected version available at http://math.boisestate.edu/~holmes/holmes/head2.ps.

  • Holmes, M.R. (2001) Strong axioms of infinity in NFU, Journal of Symbolic Logic 66, 87–116.

    Article  MathSciNet  MATH  Google Scholar 

  • Jensen, R. (1969) On the consistency of a slight (?) modification of Quine’s New Foundations, in Davidson, D. and Hintikka, J., eds., Words and Objections. Essays on the work of W.V.O. Quine, Dordrecht: Reidel, pp. 278–291.

    Chapter  Google Scholar 

  • Lawvere, F.W. (1966) The category of all categories as a foundation for mathematics, Proceedings of the La Jolla Conference on Categorical Algebra, Berlin: Springer, pp. 1–20.

    Google Scholar 

  • Mac Lane, S. (1961) Locally small categories and the foundations of mathematics, in Infinitistic Methods, Oxford: Pergamon Press, pp. 25–43.

    Google Scholar 

  • Mac Lane, S. (1971) Categories for the Working Mathematician, Berlin: Springer.

    Book  MATH  Google Scholar 

  • McLarty, C. (1992) Failure of Cartesian Closedness in NF, Journal of Symbolic Logic 57, 555–556.

    Article  MathSciNet  MATH  Google Scholar 

  • McLarty, C. (2004) Exploring categorical structuralism, Philosophia Mathematica 12, 37–53.

    Article  MathSciNet  MATH  Google Scholar 

  • Quine, W.V. (1937) New foundations for mathematical logic, The American Mathematical Monthly 44, 70–80.

    Article  MathSciNet  Google Scholar 

  • Quine, W.V. (1945) On Ordered Pairs, Journal of Symbolic Logic 10, 95–96.

    Article  MathSciNet  MATH  Google Scholar 

  • Rao, V.K. (2006) On Doing Category Theory Within Set-Theoretic Foundations, in Sica, G., ed., What is Category Theory? Monza: Polimetrica, pp. 275–290.

    Google Scholar 

  • Rosser, J.B. (1952) The axiom of infinity in Quine’s New Foundations, Journal of Symbolic Logic 9, 238–242.

    Article  MathSciNet  Google Scholar 

  • Rosser, J.B. (1953) Logic for Mathematicians, New York: McGraw-Hill. Second edition, New York: Chelsea Publishing Co., 1978.

    MATH  Google Scholar 

  • Solovay, R. (1997) The consistency strength of NFUB, http://front.math.ucdavis.edu/author/ Solovay–R*&c=LO

  • Specker, E. (1962) Typical Ambiguity in Logic, in Nagel, E., et al., eds., Methodology and Philosophy of Science. Proceedings of the 1960 International Congress, Stanford, CA: Stanford University Press, pp. 116–123.

    Google Scholar 

  • Tupailo, S. (2005) Monotone inductive definitions and consistency of New Foundations, Preprint.

    Google Scholar 

Download references

Acknowledgments

I wish to thank Ali Enayat, Thomas Forster, Randall Holmes, Robert Solovay and Sergei Tupailo for their helpful comments on a draft of this article. I am especially grateful to Shivaram Lingamneni for his work on preparing a LaTeX version of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Solomon Feferman .

Editor information

Editors and Affiliations

Appendix

Appendix

The methods used to prove Theorem 2(i), the consistency of S*, in “Unlimited”, are by an extension of those applied by Jensen (1969). They consist of three parts:

  1. 1.

    Specker (1962) reduced the consistency of NF to the existence of models \(M_T = (\langle U_i \rangle, \langle \in_i \rangle)_{i \in Z}\) of type theory with types i ranging over the set of all integers, \(Z = \{\ldots, -3, -2, -1, 0, 1, 2, 3, \ldots\}\), where \(\in_i \subseteq U_i \times U_{i+1}\), for which M T satisfies the axioms of typed comprehension and extensionality, and in addition has a type-shifting automorphism \(\sigma: U_i \to U_{i+1}\) for all \(i \in Z\). The model of NF constructed from M T is defined to be \(M^* = (U_0, \in^*)\) where for \(a, b \in U_0\), \(a \in^* b \leftrightarrow a \in_0 \sigma(b)\). Jensen observed that if M T satisfies extensionality only for non-empty classes, then M * is a model of NFU.

  2. 2.

    Ehrenfeucht and Mostowski (1956) applied the infinite Ramsey theorem to obtain models of first-order theories with indiscernibles \(\{c_i\}_{i \in I}\) in given orderings \((I, <)\). When these models are generated by Skolem functions from the indiscernibles we get elementary substructures having automorphisms induced by those of \((I, <)\). Jensen applied the Ehrenfeucht-Mostowski theorem to obtain models M of Zermelo set theory plus the Skolem function axioms having indiscernibles c i in order type \((Z, <)\) and shifting automorphism induced by \(\sigma(c_i) = c_{i+1}\). A Z-typed model as required for the Specker construction of M * is formed by taking \(U_i = \{x \mid x \in_M c_i\}\). Jensen showed that one can also arrange to have M a model of the axioms of Infinity and Choice, which leads to M * having the same properties. Thus NFU is consistent with Infinity and Choice. In order to satisfy NFUp it is only necessary to ensure of the model M that if \(x, y \in c_i\) then \(\{x\}\) and \(\{x, y\} \in c_i\), hence \((x, y) = \{\{x\}, \{x, y\}\} \in c_i\).

  3. 3.

    In part II of his paper, Jensen showed how, given any ordinal α, one can construct M * satisfying these conditions which is an end-extension of α; this uses the Erdös-Rado (1956) generalization of the Ramsey theorem to certain infinite partitions. These methods were extended in “Unlimited” to construct M * which are end-extensions of any given transitive set A. The main theorem needed for this and proved in the Appendix of “Unlimited” is in terms of models of \(L_{\infty, \omega}\) with indiscernibles satisfying certain prescribed properties. The formulation of that theorem is too technical to present here. The particular transitive set used in the application to Theorem 2(i) above is the cumulative hierarchy up to a strongly inaccessible cardinal κ. The proof also assumes the existence of a strongly inaccessible cardinal δ greater than κ.

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media B.V.

About this chapter

Cite this chapter

Feferman, S. (2011). Enriched Stratified Systems for the Foundations of Category Theory. In: Sommaruga, G. (eds) Foundational Theories of Classical and Constructive Mathematics. The Western Ontario Series in Philosophy of Science, vol 76. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-0431-2_6

Download citation

Publish with us

Policies and ethics