Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1312.6198

Categories within the Foundation of Mathematics

Benjamin Horowitz
View original source ↗Read source document ↗Export metadata ↓

Abstract

The recent trend in mathematics is towards a framework of abstract mathematical objects, rather than the more concrete approach of explicitly defining elements which objects were thought to consist of. A natural question to raise is whether this sort of abstract approach advocated for by Lawvere, among others, is foundational in the sense that it provides a unified, universal, system of first order axioms in which we can define the usual mathematical objects and prove their usual properties. In this way, we view the ``foundation" as something without any necessary justification or starting point. Some of the main arguments for categories as such a structure are laid out by MacLane as he argues that the set-theoretic constructions are inappropriate for current mathematics as practices, and that they are inadequate to properly encompass category theory itself and therefore cannot properly encompass all of mathematics, while category theory can be used to describe set theory and all the natural consequences of a given primitive system.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Benjamin Horowitz. 2013-12-21. Categories within the Foundation of Mathematics. https://arxiv.org/abs/1312.6198

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗