New answers tagged mathematical-philosophy
13
votes
Are key theorems finitistically reducible?
There are various problems with finitistic reducibility as Simpson develops it; for a survey, see §5.3 of my Stanford Encyclopedia of Philosophy entry on reverse mathematics. I tend to agree that the ...
Top 50 recent answers are included
Related Tags
mathematical-philosophy × 357lo.logic × 178
set-theory × 116
soft-question × 73
ho.history-overview × 56
foundations × 44
reference-request × 35
big-list × 25
ct.category-theory × 21
large-cardinals × 20
model-theory × 19
nt.number-theory × 13
big-picture × 12
metamathematics × 12
computability-theory × 11
proof-theory × 11
theories-of-arithmetic × 11
pr.probability × 10
constructive-mathematics × 10
gm.general-mathematics × 9
mathematics-education × 9
type-theory × 8
mp.mathematical-physics × 7
axiom-of-choice × 7
ultrafinitism × 7