The large structures of Grothendieck founded on finite order arithmetic
C. McLarty. (2011)cite http://arxiv.org/abs/1102.1773arxiv:1102.1773Comment: Adds the optimality observation: this is the weakest possible foundation for these tools. The exposition is clarified, the set theory better motivated, and some proofs made fuller.
Аннотация
Such large-structure tools of cohomology as toposes and derived categories
stay close to arithmetic in practice, yet existing foundations for them go
beyond the strong set theory ZFC. We formalize the practical insight by
founding the theorems of EGA and SGA, plus derived categories, at the level of
finite order arithmetic. This is the weakest possible foundation for these
tools since one elementary topos of sets with infinity is already this strong.
Описание
[1102.1773] The large structures of Grothendieck founded on finite order arithmetic
cite http://arxiv.org/abs/1102.1773arxiv:1102.1773Comment: Adds the optimality observation: this is the weakest possible foundation for these tools. The exposition is clarified, the set theory better motivated, and some proofs made fuller
%0 Generic
%1 mclarty2011large
%A McLarty, Colin
%D 2011
%K arithmetic finite grothendieck order
%T The large structures of Grothendieck founded on finite order arithmetic
%U http://arxiv.org/abs/1102.1773
%X Such large-structure tools of cohomology as toposes and derived categories
stay close to arithmetic in practice, yet existing foundations for them go
beyond the strong set theory ZFC. We formalize the practical insight by
founding the theorems of EGA and SGA, plus derived categories, at the level of
finite order arithmetic. This is the weakest possible foundation for these
tools since one elementary topos of sets with infinity is already this strong.
@misc{mclarty2011large,
abstract = {Such large-structure tools of cohomology as toposes and derived categories
stay close to arithmetic in practice, yet existing foundations for them go
beyond the strong set theory ZFC. We formalize the practical insight by
founding the theorems of EGA and SGA, plus derived categories, at the level of
finite order arithmetic. This is the weakest possible foundation for these
tools since one elementary topos of sets with infinity is already this strong.},
added-at = {2014-12-28T03:15:38.000+0100},
author = {McLarty, Colin},
biburl = {https://www.bibsonomy.org/bibtex/2851b2a57f76b9172f23f6b83faa208e9/t.uemura},
description = {[1102.1773] The large structures of Grothendieck founded on finite order arithmetic},
interhash = {60d75f01cbb54437a51aa3981fe48e70},
intrahash = {851b2a57f76b9172f23f6b83faa208e9},
keywords = {arithmetic finite grothendieck order},
note = {cite \href{http://arxiv.org/abs/1102.1773}{arxiv:1102.1773}Comment: Adds the optimality observation: this is the weakest possible foundation for these tools. The exposition is clarified, the set theory better motivated, and some proofs made fuller},
timestamp = {2014-12-28T03:15:38.000+0100},
title = {The large structures of Grothendieck founded on finite order arithmetic},
url = {http://arxiv.org/abs/1102.1773},
year = 2011
}