This is a preview of subscription content, log in via an institution to check access.
References
Bishop, E.: 1967, Foundations of Constructive Analysis, McGraw-Hill, New York.
Bishop, E. and H. Cheng: 1972, Constructive Measure Theory, Memoirs Amer. Math. Soc. 116.
Borel, E.: 1898, Leçons sur la théorie des fonctions, Gauthiers-Villars, Paris.
Bridges, D. S.: 1979, Constructive Functional Analysis, Research Notes in Math. 28, Pitman, London.
Davis, M.: 1958, Computability and Unsolvability, McGraw-Hill, New York.
Enderton, H. B.: 1977, ‘Elements of Recursion Theory’, in J. Barwise (ed.), Handbook of Mathematical Logic, North-Holland, Amsterdam, pp. 527–566.
Gödel, K.: 1969, ‘An Interpretation of the Intuitionistic Sentential Logic’, in J. Hintikka (ed.), The Philosophy of Mathematics, Oxford U.P., London, pp. 128–129.
Goodman, N. D.: 1984, ‘A Genuinely Intensional Set Theory’ in S. Shapiro (ed.), Intensional Mathematics, North-Holland Pub. Co., New York.
Goodman, N. D.: 1983, ‘Reflections on Bishop's Philosophy of Mathematics’, in F. Richman (ed.), Constructive Mathematics, Springer Lecture Notes No. 873, pp. 135–145, Reprinted in The Mathematical Intelligencer 5 (1983), 61–68.
Hiller, H. L., M. Huber, and S. Shelah: 1978, ‘The Structure of Ext(A, Z) and V = L’, Math. Zeitschrift 162, 39–50.
Kaplan, W.: 1973, Advanced Calculus, 2nd ed., Addison-Wesley, Reading, Mass..
Kleene, S. C.: 1952, Introduction to Metamathematics, Van Nostrand, Princeton.
Kleene, S. C.: 1967, Mathematical Logic, Wiley, New York.
Lifschitz, V.: ‘On Computable Natural Numbers’, Typescript.
Lifschitz, V.: ‘The Constructive Component of Classical Mathematics I’, Typescript.
MacLane, S.: 1975, ‘A History of Abstract Algebra: Origin. Rise, and Decline of a Movement’, in American Mathematical Heritage, Algebra and Applied Methematics, El Paso, Texas, pp. 3–35.
Myhill, J.: 1984, ‘Intensional Set Theory’, to appear in S. Shapiro (ed.), Intensional Mathematics, North-Holland Pub. Co., New York.
Quine, W. V.: 1976, ‘Three Grades of Modal Involvement’, in The Ways of Paradox and Other Essays, rev. ed., Harvard U.P., Cambridge, Mass., pp. 158–176.
Randolph, J. F.: 1968, Basic Real and Abstract Analysis, Academic Press, New York.
Rogers, H.: 1967, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York.
Rosenlicht, M.: 1968, Introduction to Analysis, Scott, Foresman, Glenview, III.
Shapiro, S.: ‘On Church's Thesis’, Typescript.
Shapiro, S.: 1984, ‘Epistemic Arithmetic and Intuitionistic Arithmetic’, to appear in S. Shapiro (ed.), Intensional Mathematics, North-Holland Pub. Co., New York.
Shelah, S.: 1979, ‘On Well Ordering and More on Whitehead's Problem’, Abstract 79T-E47, Notices Amer. Math. Soc., 26, A-442.
Shoenfield, J. R.: 1972, Degrees of Unsolvability, North-Holland, Amsterdam.
Troelstra, A. S.: 1968, ‘The Theory of Choice Sequences’, in B. Van Rootselaar and J. F. Staal (eds.), Logic, Methodology and Philosophy of Science III, North-Holland, Amsterdam, pp. 201–223.
Williamson, J. H.: 1979, Review of Topological Algebras by E. Beckenstein, L. Narici, and C. Suffel, Bull. Amer. Math. Soc. (New Series) 1, 237–244.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Goodman, N.D. The knowing mathematician. Synthese 60, 21–38 (1984). https://doi.org/10.1007/BF00485616
Issue Date:
DOI: https://doi.org/10.1007/BF00485616