Another sense in which it's not over is the question of what the weakest system is which will prove FLT. Various people have suggested that it should be provabl

Another sense in which it's not over is the question of what the weakest system is which will prove FLT. Various people have suggested that it should be provable in PA. Colin McLarty has been working on this and has managed to reduce the requirements substantially. There's a preprint available of a paper to be published in the Bulletin of Symbolic Logic, although he may have progressed further since writing that. http://www.cwru.edu/artsci/phil/Proving_FLT.pdf http://www.cwru.edu/artsci/phil/Proving_FLT.pdf