Timeline for The Hasse Minkowski theorem in Peano arithmetic
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 12, 2013 at 5:06 | vote | accept | Colin McLarty | ||
| Aug 6, 2013 at 8:52 | answer | added | Colin McLarty | timeline score: 1 | |
| Aug 3, 2013 at 1:20 | comment | added | Colin McLarty | The standard methods he mentions are standard in practice. The usual proofs of Hasse-Minkowski over $\mathbb{Q}$ (the case for other number fields is similar) reduce the $p$-adic calculation for any given rational quadratic form to calculations mod $p^n$ for $n$ specifiable from the coefficients of the form. And that is the usual point of using the theorem. But has anyone gone into the specific quantifier complexity of the theorem? | |
| Aug 2, 2013 at 18:42 | history | asked | Colin McLarty | CC BY-SA 3.0 |