- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
What does it take to prove fermat's last theorem? Grothendieck and the logic of number theory
Bulletin of Symbolic Logic 16 (3):359-377 (2010)
Abstract
This paper explores the set theoretic assumptions used in the current published proof of Fermat's Last Theorem, how these assumptions figure in the methods Wiles uses, and the currently known prospects for a proof using weaker assumptions.Author's Profile
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
An intuitionistic version of zermelo's proof that every choice set can be well-ordered.J. Todd Wilson - 2001 - Journal of Symbolic Logic 66 (3):1121-1126.
Blunt and topless end extensions of models of set theory.Matt Kaufmann - 1983 - Journal of Symbolic Logic 48 (4):1053-1073.
Mathematical logic.Heinz-Dieter Ebbinghaus - 1996 - New York: Springer. Edited by Jörg Flum & Wolfgang Thomas.
On automating diagrammatic proofs of arithmetic arguments.Mateja Jamnik, Alan Bundy & Ian Green - 1999 - Journal of Logic, Language and Information 8 (3):297-321.
Axioms of symmetry: Throwing darts at the real number line.Chris Freiling - 1986 - Journal of Symbolic Logic 51 (1):190-200.
Proof-theoretic modal PA-Completeness III: The syntactic proof.Paolo Gentilini - 1999 - Studia Logica 63 (3):301-310.
Interpolation theorems, lower Bounds for proof systems, and independence results for bounded arithmetic.Jan Krajíček - 1997 - Journal of Symbolic Logic 62 (2):457-486.
DFC-algorithms for Suszko logic and one-to-one Gentzen type formalizations.Anita Wasilewska - 1984 - Studia Logica 43 (4):395 - 404.
A lambda proof of the p-w theorem.Sachio Hirokawa, Yuichi Komori & Misao Nagayama - 2000 - Journal of Symbolic Logic 65 (4):1841-1849.
Analytics
Added to PP
2010-05-08
Downloads
461 (#39,972)
6 months
28 (#106,370)
2010-05-08
Downloads
461 (#39,972)
6 months
28 (#106,370)
Historical graph of downloads
Author's Profile
Citations of this work
Philosophy of Mathematical Practice — Motivations, Themes and Prospects†.Jessica Carter - 2019 - Philosophia Mathematica 27 (1):1-32.
Small Steps and Great Leaps in Thought: The Epistemology of Basic Deductive Rules.Joshua Schechter - 2019 - In Magdalena Balcerak Jackson & Brendan Balcerak Jackson (eds.), Reasoning: New Essays on Theoretical and Practical Thinking. Oxford: Oxford University Press.
References found in this work
Number theory and elementary arithmetic.Jeremy Avigad - 2003 - Philosophia Mathematica 11 (3):257-284.
Categories for the working mathematician: making the impossible possible.Jessica Carter - 2008 - Synthese 162 (1):1-13.
The weil conjectures.Brian Osserman - 2008 - In T. Gowers (ed.), Princeton Companion to Mathematics. Princeton University Press. pp. 729--732.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-4c2ch uwo