Categories and functors in reverse and computable mathematics

Archive for Mathematical Logic:1-31 (forthcoming)
  Copy   BIBTEX

Abstract

This paper studies categories and functors in the context of reverse and computable mathematics. In ordinary reverse mathematics, we only focuses on categories whose objects and morphisms can be represented by natural numbers. We first consider morphism sets of categories and prove several associated theorems equivalent to $$\mathrm ACA_{0}$$ over the base system $$\mathrm RCA_{0}$$. The Yoneda Lemma is a basic result in category theory and homological algebra. We then develop an effective version of the Yoneda Lemma in $$\mathrm RCA_{0}$$ ; as an application, we formalize an effective version of the Yoneda Embedding in $$\mathrm RCA_{0}$$. Products and coproducts are basic notions for defining special categories like semi-additive categories and additive categories. We study properties of products and coproducts of a sequence of objects of categories and provide effective characterizations of semi-additive categories and additive categories in terms of products and coproducts. Finally, we further consider the strength of theorems of category theory that are studied in this paper by methods of higher-order reverse mathematics.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,793

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Structure of semisimple rings in reverse and computable mathematics.Huishan Wu - 2023 - Archive for Mathematical Logic 62 (7):1083-1100.
Refining the Taming of the Reverse Mathematics Zoo.Sam Sanders - 2018 - Notre Dame Journal of Formal Logic 59 (4):579-597.
Partitions of trees and $${{\sf ACA}^\prime_{0}}$$.Bernard A. Anderson & Jeffry L. Hirst - 2009 - Archive for Mathematical Logic 48 (3-4):227-230.
Problems with the category theoretic notions of ultraproducts.Hien Huy Bui & István Németi - 1981 - Bulletin of the Section of Logic 10 (3):122-126.
The Thin Set Theorem for Pairs Implies DNR.Brian Rice - 2015 - Notre Dame Journal of Formal Logic 56 (4):595-601.
Abstractionist Categories of Categories.Shay Allen Logan - 2015 - Review of Symbolic Logic 8 (4):705-721.
Categories.Jean-Pierre Marquis - 2012 - In Sven Ove Hansson & Vincent F. Hendricks (eds.), Introduction to Formal Philosophy. Cham: Springer. pp. 251-271.
Representations and the Foundations of Mathematics.Sam Sanders - 2022 - Notre Dame Journal of Formal Logic 63 (1):1-28.
Iterated multiplication in $$ VTC ^0$$.Emil Jeřábek - 2022 - Archive for Mathematical Logic 61 (5):705-767.

Analytics

Added to PP
2025-01-01

Downloads
2 (#1,951,855)

6 months
2 (#1,735,400)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
Uniformly defined descending sequences of degrees.Harvey Friedman - 1976 - Journal of Symbolic Logic 41 (2):363-367.
Reverse Mathematics and Fully Ordered Groups.Reed Solomon - 1998 - Notre Dame Journal of Formal Logic 39 (2):157-189.
Necessary use of [image] induction in a reversal.Itay Neeman - 2011 - Journal of Symbolic Logic 76 (2):561 - 574.
Countable algebra and set existence axioms.Harvey M. Friedman - 1983 - Annals of Pure and Applied Logic 25 (2):141.

View all 6 references / Add more references