Graduate studies at Western
Synthese 141 (3):333 - 364 (2004)
|Abstract||This paper studies the use of hypotheses schemes in generatinginductive predictions. After discussing Carnap–Hintikka inductive logic,hypotheses schemes are defined and illustrated with two partitions. Onepartition results in the Carnapian continuum of inductive methods, the otherresults in predictions typical for hasty generalization. Following theseexamples I argue that choosing a partition comes down to making inductiveassumptions on patterns in the data, and that by choosing appropriately anyinductive assumption can be made. Further considerations on partitions makeclear that they do not suggest any solution to the problem of induction.Hypotheses schemes provide the tools for making inductive assumptions, but theyalso reveal the need for such assumptions.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Brian Skyrms (1991). Carnapian Inductive Logic for Markov Chains. Erkenntnis 35 (1-3):439 - 460.
John Norton (2010). Deductively Definable Logies of Induction. Journal of Philosophical Logic 39 (6):617 - 654.
Festa, Roberto, Optimum Inductive Methods. A Study in Inductive Probability, Bayesian Statistics, and Verisimilitude.
John D. Norton (2003). A Material Theory of Induction. Philosophy of Science 70 (4):647-670.
Theo A. F. Kuipers (1978). On the Generalization of the Continuum of Inductive Methods to Universal Hypotheses. Synthese 37 (3):255 - 284.
Romeyn, J.-W. (2004). Hypotheses and Inductive Predictions. Synthese 141 (3):333-364.
Added to index2009-01-28
Total downloads8 ( #131,771 of 739,318 )
Recent downloads (6 months)1 ( #61,243 of 739,318 )
How can I increase my downloads?