Mathematics is at the beginning of a new foundational crisis. Twenty years ago there was a firm consensus that mathematics is set theory and that set theory is Zermelo-Fraenkel set theory (ZF). That consensus is breaking down. It is breaking down for two quite different reasons. One of these is a turning away from the excesses of the tendency toward abstraction in post-war mathematics. Many mathematicians feel that the power of the method of abstraction and generalization has, for the time being, exhausted itself. We have done about as much as can be done now by these means, and it is time to return once more to hard work on particular examples. (For this point of view see Mac Lane [16, pp. 37–38].) Another reason for this turning back from abstraction is the economic fact that society is less prepared now than it was twenty years ago to support abstract intellectual activity pursued for its own sake. Those who support research are asking more searching questions than formerly about the utility of the results that can reasonably be expected from projects proposed. Mathematicians, moreover, are increasingly obliged to seek employment not in departments emphasizing pure mathematics, but in departments of computer science or statistics, or even in industry. Thus there is a heightened interest in applied and applicable mathematics and an increased tendency to reject as abstract nonsense what our teachers considered an intellectually satisfying level of generality. The set-theoretic account of the foundations of mathematics, however, is inextricably linked with just this tendency to abstraction for its own sake. Mathematics, on that account, is about abstract structures which, at best, may happen to be isomorphic to structures found in the physical world, but which are themselves most definitely not in the physical world. Thus as mathematicians turn away from pure abstraction, they also become increasingly dissatisfied with the doctrine that mathematics is set theory and nothing else.
[1]
Stewart Shapiro,et al.
Epistemic and Intuitionistic Arithmetic
,
1985
.
[2]
Frits Staal,et al.
Logic, Methodology and Philosophy of Science Iii
,
1968
.
[3]
Herbert B. Enderton,et al.
Elements of Recursion Theory
,
1977
.
[4]
É. Borel.
Leçons sur la théorie des fonctions
,
2009
.
[5]
Reflections on bishop’s philosophy of mathematics
,
1983
.
[6]
John Myhill.
Intensional Set Theory
,
1985
.
[7]
E. Bishop,et al.
Constructive measure theory
,
1972
.
[8]
A. S. Troelstra,et al.
The Theory of Choice Sequences
,
1968
.
[9]
Joseph R. Shoenfield,et al.
Degrees of unsolvability
,
1959,
North-Holland mathematics studies.
[10]
S. C. Kleene,et al.
Introduction to Metamathematics
,
1952
.
[11]
Martin D. Davis,et al.
Computability and Unsolvability
,
1959,
McGraw-Hill Series in Information Processing and Computers.
[12]
S. Shelah,et al.
The structure of ext (A,ℤ) andV=L
,
1978
.
[13]
John F. Randolph,et al.
Basic real and abstract analysis
,
1968
.
[14]
Jr. Hartley Rogers.
Theory of Recursive Functions and Effective Computability
,
1969
.
[15]
M. Rosenlicht.
Introduction to Analysis
,
1970
.
[16]
H. Keisler,et al.
Handbook of mathematical logic
,
1977
.
[17]
Stephen Cole Kleene.
Mathematical Logic
,
1967
.
[18]
Nicolas D. Goodman.
A Genuinely Intensional Set Theory
,
1985
.
[19]
S. Korner,et al.
The philosophy of mathematics
,
1960
.
[20]
D. Bridges,et al.
Constructive functional analysis
,
1979
.