Deductively Definable Logics of Induction
Author: Norton, John
Source: Journal of Philosophical Logic, Volume 39, Number 6, December 2010 , pp. 617-654(38)
Abstract: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.
Document Type: Research Article
Affiliations: Center for Philosophy of Science, Department of History and Philosophy of Science, University of Pittsburgh, Pittsburgh, PA, USA, Email: firstname.lastname@example.org
Publication date: December 2010