Probabilistic Entailment and a Non-Probabilistic Logic

Logic Journal of the IGPL 11 (3):353-365 (2003)
  Copy   BIBTEX

Abstract

In this paper we present a probabilistic notion of entailment for finite sets of premises, which has classical entailment as a special case, and show that it is well defined; i.e., that the problem of whether a sentence is entailed by a set of premises is computable. Further we present a natural deductive system and prove that it is the strongest deductive system possible without referring to probabilities

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Probabilistic Grammars and Languages.András Kornai - 2011 - Journal of Logic, Language and Information 20 (3):317-328.
A probabilistic extension of intuitionistic logic.Z. Ognjanovic & Z. Markovic - 2003 - Mathematical Logic Quarterly 49 (4):415.
Probabilistic algorithmic randomness.Sam Buss & Mia Minnes - 2013 - Journal of Symbolic Logic 78 (2):579-601.
Probabilistic dynamic epistemic logic.Barteld P. Kooi - 2003 - Journal of Logic, Language and Information 12 (4):381-408.

Analytics

Added to PP
2015-02-04

Downloads
13 (#973,701)

6 months
4 (#678,769)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references