Deductively Definable Logies of Induction

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)
DOI 10.2307/40925871
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,667
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
John D. Norton (2003). A Material Theory of Induction. Philosophy of Science 70 (4):647-670.

View all 13 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

38 ( #87,235 of 1,726,249 )

Recent downloads (6 months)

15 ( #48,707 of 1,726,249 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.