Inter-universal geometry と ABC予想 (応援スレ) 77

[過去ﾛｸﾞ] Inter-universal geometry と ABC予想 (応援スレ) 77 (1002ﾚｽ)
上下前次1-新
抽出解除ﾚｽ栞

このｽﾚｯﾄﾞは過去ﾛｸﾞ倉庫に格納されています｡
次ｽﾚ検索歴削→次ｽﾚ栞削→次ｽﾚ過去ﾛｸﾞﾒﾆｭｰ

245(1): 現代数学の系譜雑談 ◆yH25M02vWFhP 11/04(火)23:22 ID:yzUd5nV9(7/9) AAS
>>243 補足
検索してみると (google検索)：
Colin McLarty,The Large structures of Grothendiek founded on finite-order arithmetic. Rev.Symb.Log

で、結果は下記
＜検索結果＞
The large structures of Grothendieck founded on finite ...
arXiv
外部ﾘﾝｸ:arxiv.org›math
このページを訳す
C McLarty 著 · 2011 · 被引用数: 14 — We formalize the practical insight by founding the theorems of EGA and SGA, plus derived categories, at the level of finite order arithmetic.
省27

249(2): 現代数学の系譜雑談 ◆yH25M02vWFhP 11/05(水)10:13 ID:K/Lr81ky(1/12) AAS
>>245 追加
(google検索)：
Colin McLarty,The Large structures of Grothendieck founded on finite-order arithmetic. Rev.Symbol.Logo
＜AI による概要＞
Colin McLarty's paper, "The Large Structures of Grothendieck Founded on Finite-Order Arithmetic," published in the Review of Symbolic Logic in 2020, argues that the complex tools of Grothendieck-style algebraic geometry, such as toposes and derived categories, can be founded on the much weaker system of finite-order arithmetic, rather than the stronger ZFC set theory typically used for such foundations. This research aims to close the foundational gap by showing that these powerful "large structure" tools only require a significantly weaker logical strength to be established, with one specific topos of sets already requiring this level of strength.
・Core argument: McLarty demonstrates that the theorems of Grothendieck's Éléments de géométrie algébrique (EGA) and Séminaire de géométrie algébrique du Bois-Marie (SGA), along with derived categories, can be formally grounded using finite-order arithmetic.
・Weakest possible foundation: The paper establishes that finite-order arithmetic is the weakest possible foundation for these tools because even a single elementary topos of sets with infinity is already this strong.
・Implication for set theory: This finding implies that one does not need the full strength of ZFC, which is stronger than finite-order arithmetic, to prove the consistency of these large structures. The work shows that their foundations can be established with axioms that have the same proof-theoretic strength as finite-order arithmetic, which Zermelo set theory (Z) proves is consistent.
・Practical insight: The work formalizes the practical insight that tools of cohomology, while theoretically requiring large structures, often stay close to arithmetic in their actual application.
・Publication details: The paper was published in the Review of Symbolic Logic (Volume 13, Issue 2, 2020), with the doi: 10.1017/s1755020319000340 and can be found on arXiv as paper 1102.1773.
省2

上下前次1-新書関写板覧索設栞歴

ｽﾚ情報赤ﾚｽ抽出画像ﾚｽ抽出歴の未読ｽﾚ AAｻﾑﾈｲﾙ

ぬこの手ぬこTOP 0.034s