Displaying similar documents to “Completeness Theorem for a Monadic Logic with Both First-order and Probability Quantifiers”

Inference in conditional probability logic

Niki Pfeifer, Gernot D. Kleiter (2006)

Kybernetika

Similarity:

An important field of probability logic is the investigation of inference rules that propagate point probabilities or, more generally, interval probabilities from premises to conclusions. Conditional probability logic (CPL) interprets the common sense expressions of the form “if ..., then ...” by conditional probabilities and not by the probability of the material implication. An inference rule is probabilistically informative if the coherent probability interval of its conclusion is...

Between logic and probability.

Ton Sales (1994)

Mathware and Soft Computing

Similarity:

Logic and Probability, as theories, have been developed quite independently and, with a few exceptions (like Boole's), have largely ignored each other. And nevertheless they share a lot of similarities, as well a considerable common ground. The exploration of the shared concepts and their mathematical treatment and unification is here attempted following the lead of illustrious researchers (Reichenbach, Carnap, Popper, Gaifman, Scott & Krauss, Fenstad, Miller, David Lewis, Stalnaker,...