Skip to main content
7 events
when toggle format what by license comment
Aug 7, 2020 at 11:38 comment added Display name Alternatively, $PA \vdash \lnot FLT$ is not possible because whatever can be proven in PA can be proven in ZFC, so we would get $ZFC \vdash \lnot FLT,$ implying ZFC is inconsistent, in which case we have much bigger problems to worry about.
Jan 10, 2020 at 18:32 history edited Denis Serre CC BY-SA 4.0
added 2 characters in body
Feb 16, 2018 at 4:17 vote accept Christopher King
Feb 16, 2018 at 2:45 answer added Timothy Chow timeline score: 29
Feb 15, 2018 at 5:54 history edited Christopher King
edited tags
Feb 15, 2018 at 5:50 comment added David Roberts Here's a lower bound, of sorts: arxiv.org/abs/1602.03580 gives a very weak theory of arithmetic with a model where FLT cannot be proven.
Feb 15, 2018 at 3:34 history asked Christopher King CC BY-SA 3.0