Probabilistic Entailment and a Non-Probabilistic Logic

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


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



    Upload a copy of this work     Papers currently archived: 93,642

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 Default Reasoning with Conditional Constraints.Thomas Lukasiewicz - 2000 - Linköping Electronic Articles in Computer and Information Science 5.
Proof Systems for Exact Entailment.Johannes Korbmacher - 2023 - Review of Symbolic Logic 16 (4):1260-1295.
Computational Aspects of Quasi-Classical Entailment.Pierre Marquis & Nadège Porquet - 2001 - Journal of Applied Non-Classical Logics 11 (3-4):294-312.
Probabilities with Gaps and Gluts.Dominik Klein, Ondrej Majer & Soroush Rafiee Rad - 2021 - Journal of Philosophical Logic 50 (5):1107-1141.


Added to PP

3 (#1,213,485)

6 months
13 (#1,035,185)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references