This is a preview of subscription content, log in via an institution to check access.
References
Ehrenfeucht, A., ‘Polynomial Functions with Exponentiation Are Well Ordered’, Algebra universalis 3 (1973), 261–263.
Gandy, R. O., ‘The Concept of Computability’, in R. Harré (ed.), Scientific Thought 1900–1960, Clarendon Press, Oxford, 1969.
Kreisel, G., ‘Which Number Theoretic Problems Can Be Solved in Recursive Progressions on π 11 -Paths Through 0?’, Journal of Symbolic Logic 37 (1972), 311–334 (reviewed in Zentralblatt 255 (1973), 28–29).
Mints, G. E., ‘On E-theorems’, Zapiski 40 (1974), 101–118.
Moser, J., ‘Stable and Random Motions in Dynamical Systems, with Special Emphasis on Celestial Mechanics’, Annals of Mathematics Studies, Vol. 77, Princeton University Press, Princeton, N.J., 1973.
Orekov, V. P., ‘On Constructive Mappings of a Circle into Itself’, Proceedings of the Steklov Institute 72 (1964), 437–446.
Richardson, D., ‘Some Undecidable Problems Involving Elementary Functions of a Real Variable’, Journal of Symbolic Logic 33 (1968), 514–520.
Richardson, D., ‘Solution of the Identity Problem for Integral Exponential Functions’, Zeitschrift für mathematische Logik und Grundlagen 15 (1969), 333–340.
Scarpellini, B., ‘Zwei unentscheidbare Probleme der Analysis’, Zeitschrift für mathematische Logik und Grundlagen 9 (1963), 265–289.
Specker, E. P., ‘Der Satz vom Maximum in der rekursiven Analysis’, in A. Heyting (ed.), Constructivity in Mathematics, North-Holland, Amsterdam, 1959.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kreisel, G. A notion of mechanistic theory. Synthese 29, 11–26 (1974). https://doi.org/10.1007/BF00484949
Issue Date:
DOI: https://doi.org/10.1007/BF00484949