A note on binary inductive logic

Journal of Philosophical Logic 36 (6):735 - 771 (2007)
Abstract
We consider the problem of induction over languages containing binary relations and outline a way of interpreting and constructing a class of probability functions on the sentences of such a language. Some principles of inductive reasoning satisfied by these probability functions are discussed, leading in turn to a representation theorem for a more general class of probability functions satisfying these principles
Keywords exchangeability  inductive logic  probability logic  uncertain reasoning
Categories (categorize this paper)
Options
 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: 11,399
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

No references found.

Citations of this work BETA
J. B. Paris & A. Vencovská (2012). Symmetry in Polyadic Inductive Logic. Journal of Logic, Language and Information 21 (2):189-216.
Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

16 ( #104,242 of 1,102,938 )

Recent downloads (6 months)

7 ( #36,687 of 1,102,938 )

How can I increase my downloads?

My notes
Sign in to use this feature


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