The large structures of grothendieck founded on finite-order arithmetic

Review of Symbolic Logic 13 (2):296-325 (2020)
  Copy   BIBTEX

Abstract

The large-structure tools of cohomology including toposes and derived categories stay close to arithmetic in practice, yet published foundations for them go beyond ZFC in logical strength. We reduce the gap by founding all the theorems of Grothendieck’s SGA, plus derived categories, at the level of Finite-Order Arithmetic, far below ZFC. This is the weakest possible foundation for the large-structure tools because one elementary topos of sets with infinity is already this strong.

Categories

Keywords

Reprint years

DOI

10.1017/s1755020319000340

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

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

Through your library

My notes

Similar books and articles

Combinatorics with definable sets: Euler characteristics and grothendieck rings.Jan Krajíček & Thomas Scanlon - 2000 - Bulletin of Symbolic Logic 6 (3):311-330.
Combinatorics with definable sets: Euler characteristics and Grothendieck rings.Jan Krají Cek & Thomas Scanlon - 2000 - Bulletin of Symbolic Logic 6 (3):311-330.
Structuralism and Isomorphism.Charles McCarty - 2013 - Philosophia Mathematica (1):nkt024.
Theories of arithmetics in finite models.Michał Krynicki & Konrad Zdanowski - 2005 - Journal of Symbolic Logic 70 (1):1-28.
A characterization theorem for geometric logic.Olivia Caramello - 2011 - Annals of Pure and Applied Logic 162 (4):318-321.
Quantum Event Structures from the Perspective of Grothendieck Topoi.Elias Zafiris - 2004 - Foundations of Physics 34 (7):1063-1090.
Algebraic Methods and Bounded Formulas.Domenico Zambella - 1997 - Notre Dame Journal of Formal Logic 38 (1):37-48.
The First-Order Structure of Weakly Dedekind-Finite Sets.A. C. Walczak-Typke - 2005 - Journal of Symbolic Logic 70 (4):1161 - 1170.
Relativized Grothendieck topoi.Nathanael Leedom Ackerman - 2010 - Annals of Pure and Applied Logic 161 (10):1299-1312.
On finite rigid structures.Yuri Gurevich & Saharon Shelah - 1996 - Journal of Symbolic Logic 61 (2):549-562.
On second-order generalized quantifiers and finite structures.Anders Andersson - 2002 - Annals of Pure and Applied Logic 115 (1--3):1--32.
Profinite Structures are Retracts of Ultraproducts of Finite Structures.H. Mariano & F. Miraglia - 2007 - Reports on Mathematical Logic.
Epsilon-logic is more expressive than first-order logic over finite structures.Martin Otto - 2000 - Journal of Symbolic Logic 65 (4):1749-1757.
The isomorphism problem for ω-automatic trees.Dietrich Kuske, Jiamou Liu & Markus Lohrey - 2013 - Annals of Pure and Applied Logic 164 (1):30-48.
Epsilon-Logic Is More Expressive Than First-Order Logic over Finite Structures.Martin Otto - 2000 - Journal of Symbolic Logic 65 (4):1749-1757.

Analytics

Added to PP
2019-08-03

Downloads
45 (#337,378)

6 months
6 (#431,022)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Colin McLarty
Case Western Reserve University

Citations of this work

Add more citations

References found in this work

Proof Theory.Gaisi Takeuti - 1990 - Studia Logica 49 (1):160-161.
The strength of Mac Lane set theory.A. R. D. Mathias - 2001 - Annals of Pure and Applied Logic 110 (1-3):107-234.
Topos Theory.P. T. Johnstone - 1982 - Journal of Symbolic Logic 47 (2):448-450.

View all 6 references / Add more references