SearcharxivSearch

arXiv · 1603.03272

Feferman's Forays into the Foundations of Category Theory

Abstract

This paper is primarily concerned with assessing a set-theoretical system, $S^*$, for the foundations of category theory suggested by Solomon Feferman. $S^*$ is an extension of NFU, and may be seen as an attempt to accommodate unrestricted categories such as the category of all groups (without any small/large restrictions), while still obtaining the benefits of ZFC on part of the domain. A substantial part of the paper is devoted to establishing an improved upper bound on the consistency strength of $S^*$. The assessment of $S^*$ as a foundation of category theory is framed by the following general desiderata (R) and (S). (R) asks for the unrestricted existence of the category of all groups, the category of all categories, the category of all functors between two categories, etc., along with natural implementability of ordinary mathematics and category theory. (S) asks for a certain relative distinction between large and small sets, and the requirement that they both enjoy the full benefits of the $\mathrm{ZFC}$ axioms. $S^*$ satisfies (R) simply because it is an extension of NFU. By means of a recursive construction utilizing the notion of strongly cantorian sets, we argue that it also satisfies (S). Moreover, this construction yields a lower bound on the consistency strength of $S^*$. We also exhibit a basic positive result for category theory internal to NFU that provides motivation for studying NFU-based foundations of category theory.

Explore related subjects

Keep this discovery

BibTeXRIS

Ali Enayat, Paul Gorbow, Zachiri McKenzie. 2016-03-10. Feferman's Forays into the Foundations of Category Theory. https://arxiv.org/abs/1603.03272

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO