This HTML5 document contains 72 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n14https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Fréchet_inequalities
rdf:type
yago:WikicatProbabilisticInequalities dbo:AustralianRulesFootballPlayer yago:WikicatStatisticalInequalities yago:Attribute100024264 yago:Abstraction100002137 yago:Quality104723816 yago:Inequality104752221 yago:Difference104748836
rdfs:label
Fréchet inequalities
rdfs:comment
In probabilistic logic, the Fréchet inequalities, also known as the Boole–Fréchet inequalities, are rules implicit in the work of George Boole and explicitly derived by Maurice Fréchet that govern the combination of probabilities about logical propositions or events logically linked together in conjunctions (AND operations) or disjunctions (OR operations) as in Boolean expressions or fault or event trees common in risk assessments, engineering design and artificial intelligence. These inequalities can be considered rules about how to bound calculations involving probabilities without assuming independence or, indeed, without making any dependence assumptions whatsoever. The Fréchet inequalities are closely related to the Boole–Bonferroni–Fréchet inequalities, and to Fréchet bounds.
dcterms:subject
dbc:Probability_bounds_analysis dbc:Statistical_inequalities dbc:Probabilistic_inequalities dbc:Articles_containing_proofs
dbo:wikiPageID
35736414
dbo:wikiPageRevisionID
1100454928
dbo:wikiPageWikiLink
dbr:Union_(set_theory) dbr:George_Boole dbr:Fréchet_bounds dbr:Probabilistic_logic dbr:OR_gate dbr:Hermitian_matrices dbr:Intersection_(set_theory) dbr:Event_trees dbr:Quantum_mechanics dbr:Logical_disjunction dbr:Risk_assessments dbr:AND_gate dbr:Logical_proposition dbc:Probability_bounds_analysis dbr:Probability_distribution dbc:Probabilistic_inequalities dbc:Statistical_inequalities dbr:Independence dbr:Stochastic_dependence dbr:Artificial_intelligence dbr:Fault_tree dbr:Reliability_theory dbr:Copula_(probability_theory) dbr:Probability dbr:Logical_conjunction dbr:Positive-definite_matrix dbr:Boolean_algebra dbr:Pairwise_independence dbr:Separable_state dbr:Identity_matrix dbr:Density_matrix dbr:Probability_bounds_analysis dbr:Set_theory dbr:Maurice_René_Fréchet dbr:Tensor_product dbr:Reduction_criterion dbr:Event_(probability_theory) dbc:Articles_containing_proofs dbr:Engineering_design dbr:Set_(mathematics) dbr:Entangled_state dbr:Bell_inequality dbr:Modus_ponens dbr:Boole's_inequality
owl:sameAs
n14:4jVFn freebase:m.0jt65qk wikidata:Q5506660
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Math dbt:Rp dbt:Val
dbo:abstract
In probabilistic logic, the Fréchet inequalities, also known as the Boole–Fréchet inequalities, are rules implicit in the work of George Boole and explicitly derived by Maurice Fréchet that govern the combination of probabilities about logical propositions or events logically linked together in conjunctions (AND operations) or disjunctions (OR operations) as in Boolean expressions or fault or event trees common in risk assessments, engineering design and artificial intelligence. These inequalities can be considered rules about how to bound calculations involving probabilities without assuming independence or, indeed, without making any dependence assumptions whatsoever. The Fréchet inequalities are closely related to the Boole–Bonferroni–Fréchet inequalities, and to Fréchet bounds. If Ai are logical propositions or events, the Fréchet inequalities are * Probability of a logical conjunction * Probability of a logical disjunction where P denotes the probability of an event or proposition. In the case where there are only two events, say A and B, the inequalities reduce to * Probability of a logical conjunction * Probability of a logical disjunction The inequalities bound the probabilities of the two kinds of joint events given the probabilities of the individual events. For example, if A is "has lung cancer", and B is "has mesothelioma", then A & B is "has both lung cancer and mesothelioma", and A ∨ B is "has lung cancer or mesothelioma or both diseases", and the inequalities relate the risks of these events. Note that logical conjunctions are denoted in various ways in different fields, including AND, &, ∧ and graphical AND-gates. Logical disjunctions are likewise denoted in various ways, including OR, |, ∨, and graphical OR-gates. If events are taken to be sets rather than logical propositions, the set-theoretic versions of the Fréchet inequalities are * Probability of an intersection of events * Probability of a union of events
gold:hypernym
dbr:Rules
prov:wasDerivedFrom
wikipedia-en:Fréchet_inequalities?oldid=1100454928&ns=0
dbo:wikiPageLength
16389
foaf:isPrimaryTopicOf
wikipedia-en:Fréchet_inequalities