David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Philosophical Logic 39 (6):617 - 654 (2010)
A broad class of inductive logics that includes the probability calculus is defined by the conditions that the inductive strengths [A|B] are defined fully in terms of deductive relations in preferred partitions and that they are asymptotically stable. Inductive independence is shown to be generic for propositions in such logics; a notion of a scale-free inductive logic is identified; and a limit theorem is derived. If the presence of preferred partitions is not presumed, no inductive logic is definable. This no-go result precludes many possible inductive logics, including versions of hypothetico-deductivism
|Keywords||Bayesianism Confirmation Induction Non-probabilistic|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Kevin B. Korb (1992). The Collapse of Collective Defeat: Lessons From the Lottery Paradox. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1992:230 - 236.
John D. Norton (2007). Probability Disassembled. British Journal for the Philosophy of Science 58 (2):141 - 171.
Jan-Willem Romeijn (2004). Hypotheses and Inductive Predictions. Synthese 141 (3):333 - 364.
John D. Norton, The Inductive Significance of Observationally Indistinguishable Spacetimes: (Peter Achinstein has the Last Laugh).
Stephen L. Bloom (1976). Projective and Inductive Generation of Abstract Logics. Studia Logica 35 (3):249 - 255.
John D. Norton (2003). A Material Theory of Induction. Philosophy of Science 70 (4):647-670.
John D. Norton (2010). There Are No Universal Rules for Induction. Philosophy of Science 77 (5):765-777.
Romeyn, J.-W. (2004). Hypotheses and Inductive Predictions. Synthese 141 (3):333-364.
Added to index2009-01-28
Total downloads12 ( #104,704 of 1,008,711 )
Recent downloads (6 months)1 ( #64,702 of 1,008,711 )
How can I increase my downloads?