Abstract
A plausible picture of induction holds that (1) repeated conjoint occurrences of two event-types lead us to expect one in the presence of the other, (2) these anticipations are most often successful, and (3) their success is owing to discoverable facets of nature, above all, its ‘uniformity’. Arthur Burks develops this line of thought in Chance, Cause, Reason (to which otherwise unspecified page numbers refer), but incorporates essential modifications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asquith, P. and H. Kyburg, (eds.): 1979, Current Research in Philosophy of Science, Philosophy of Science Association, East Lansing, Michigan.
Burks, A. W.: 1977, Chanch, Cause, Reason, University of Chicago Press, Chicago.
Burks, A. W.: 1979, ‘Computer science and philosophy’, in Asquith and Kyburg (eds.)(1979), pp. 399–417.
Burks, A. W.: 1980, ‘Enumerative induction versus eliminative induction’, in Cohen and Hesse (1980), pp. 172–189.
Chaitin, G. J.: 1974, ‘Information-theoretic limitations of formal systems’, Journal of the Association for Computing Machinery 21, pp. 403–424.
Chaitin, G.J.: 1975, ‘Randomness and mathematical proof’, Scientific American 232 (May, 1975), pp. 47–52.
Cohen, L.J. and M. Hesse (eds): 1980, Applications of Inductive Logic, Oxford University Press, Oxford.
DeFinetti, B.: 1972, Probability, Induction, Statistics, John Wiley & Sons, New York.
Holland, J.: 1975, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor.
Hoyle, Fred: 1962, Astronomy, Rathbone Books, London.
Jaynes, E. T.: 1968, ‘Prior probabilities’, IEEE Trans. Systems Sei. & Cybernetics, SSC-4, pp. 227–241.
Rosenkrantz, R. D.: 1977, Inference, Method and Decision, D. Reidel, Dordrecht.
Rosenkrantz, R. D.: 1981, ‘Does the philosophy of induction rest on a mistake?’, Journal of Philosophy KXXIX, pp. 78–97.
Samuel, A. L.: 1959, ‘Some studies in machine learning using the game of checkers’, IBM Journal of Research and Development 3, pp. 211–232.
Samuel, A. L.: 1967, ‘Some studies in machine learning using the game of checkers II -Recent progress’, IBM Journal of Research and Development 11, pp. 601–617.
Von Neumann, J.: 1966, Theory of Self-Reproducing Automata, edited and completed by Arthur Burks, University of Illinois Press, Urbana.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Kluwer Academic Publishers
About this chapter
Cite this chapter
Rosenkrantz, R.D. (1990). Arthur Burks on the Presuppositions of Induction. In: Salmon, M.H. (eds) The Philosophy of Logical Mechanism. Synthese Library, vol 206. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-0987-8_13
Download citation
DOI: https://doi.org/10.1007/978-94-009-0987-8_13
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-6933-5
Online ISBN: 978-94-009-0987-8
eBook Packages: Springer Book Archive