A A.... G
| Abstract | These notes are meant to continue from the paper on Consistency, in proving number-theoretic theorems from the second-order arithmetical system called FFFF. Its ultimate target is Quadratic Reciprocity, although it introduces and proves some facts about the least common multiple at the start. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,701 |
| External links |
  Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesEnrico Moriconi (2003). On the Meaning of Hilbert's Consistency Problem (Paris, 1900). Synthese 137 (1-2):129 - 139.
Saharon Shelah (1989). The Number of Pairwise Non-Elementary-Embeddable Models. Journal of Symbolic Logic 54 (4):1431-1455.
Moti Mizrahi (forthcoming). On Proving Too Much. Acta Analytica.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-12-22Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
