Best Possible Inequalities for the Probability of a Logical Function of Events
From MaRDI portal
Publication:5341341
DOI10.2307/2313491zbMath0132.13706OpenAlexW4232066618MaRDI QIDQ5341341
Publication date: 1965
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2313491
Related Items
New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions, Polyhedral functions and multiparametric linear programming, PROBABILISTIC ROLE MODELS AND THE GUARDED FRAGMENT, Direct algorithms for checking consistency and making inferences from conditional probability assessments, Probabilistic inequalities and measurements in bipartite systems, Extremal Probability Bounds in Combinatorial Optimization, Computational complexity of queries based on itemsets, Boole's conditions of possible experience and reasoning under uncertainty, Probabilistic logic with independence, A logic and computation for Popper's conditional probabilities, The differential of probabilistic entailment, Logical perspectives on the foundations of probability, Generalizing probabilistic material implication and Bayesian conditionals, Ultra-quantum coherent states in a single finite quantum system, Network reliability: Heading out on the highway, Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation, Tight Probability Bounds with Pairwise Independence, On the complete description of entangled systems. I: Exploring hidden variables and context communication cost in simulating quantum correlations, Computing bounds for the probability of the union of events by different methods, Generalizing inference rules in a coherence-based probabilistic default reasoning, Roots and (Re)sources of Value (In)definiteness Versus Contextuality, Scharfe untere und obere Schranken für die Wahrscheinlichkeit der Realisation von k unter n Ereignissen, Sequent calculus for classical logic probabilized, Sequential decision making with partially ordered preferences, Best second order bounds for two-terminal network reliability with dependent edge failures, Correlation polytopes: Their geometry and complexity, The development of probability logic from leibniz to maccoll, Compatibility, desirability, and the running intersection property, Fréchet optimal bounds on the probability of a union with supplementary information, Complexity of some graph-based bounds on the probability of a union of events, Towards classifying propositional probabilistic logics, An Extension of the Charnes-Cooper Method in Linear Fractional Programming, Upper and lower bounds for the probability that r events occur, An anytime deduction algorithm for the probabilistic logic and entailment problems, Bonferroni-type inequalities; Chebyshev-type inequalities for the distributions on \([0, n\)], Bounding the probability of the union of events by aggregation and disaggregation in linear programs, Extension of the concept of propositional deduction from classical logic to probability: An overview of probability-selection approaches, Safe projections of binary data sets, Bounds for increasing multi-state consecutive \(k\)-out-of-\(r\)-from-\(n\): \(F\) system with equal components probabilities, Merging the local and global approaches to probabilistic satisfiability, Automatic derivation of probabilistic inference rules, Probability logic in the twentieth century, Improved bounds on the probability of the union of events some of whose intersections are empty, Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables, Probabilistic sentence satisfiability: an approach to PSAT, Das maximale Signifikanzniveau des Tests: Lehne \(H_0\) ab, wenn \(k\) unter \(n\) gegebenen Tests zur Ablehnung führen, A combinatorial optimization approach to the selection of statistical units, Probability bounds given by hypercherry trees, The theory of interval probabilistic logic programs, Polynomially Computable Bounds for the Probability of the Union of Events, Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem, Bivalent trees and forests or upper bounds for the probability of a union revisited, The value of shape constraints in discrete moment problems: a review and extension, Probabilistic satisfiability and coherence checking through integer programming, Probabilistic satisfiability with imprecise probabilities, Logics with Probability Operators, Probabilized Sequent Calculus and Natural Deduction System for Classical Logic
