Question abount independence events and conditional events

AI Thread Summary
The discussion focuses on proving implications related to independence and conditional events. It establishes that if events A and B are independent, then the negations of these events are also independent. Additionally, it discusses the conditions under which the probabilities of A and B can be compared based on their conditional probabilities given another event C. The probability that C lied, given the statements made by A and B, is derived using the independence of A and B and their truth-telling probabilities. The final result provides a formula for calculating the probability that C lied based on the truth-telling probability p.
Alexsandro
Messages
49
Reaction score
0
Prove this questions using ration ideal in intuitive way.

Prove this implications and explain the results:

(a) A _|_ B => not A _|_ not B, onde _|_ means that events A and B are independent.

(b)[ P(A|C) >= P(B|C) ] and [ P(A|not C) >= P(B|not C) ] ==> P(A) > P(B)
 
Last edited:
Physics news on Phys.org
Question about who tells the truth.

Interesting question:

" A says that B told him that C lied ".

If each of these person tells the truth with probability p, what is the probability that C lied ?
 
A \perp B \longrightarrow P(A|B) = P(A) \longrightarrow \frac{P(A \& B)}{P(B)} = P(A) \longrightarrow

\frac{P(A) - P(A \&amp; \~B)}{1 - P(\~B)} = P(A) \longrightarrow <br /> \frac{[1 - P(\~A)] - [P(\~B) - P(\~A \&amp; \~B)]}{1 - P(\~B)} = 1 - P(\~A) \longrightarrow

1 - P(\~A) - P(\~B) + P(\~A \&amp; \~B) = 1 - P(\~A) - P(\~B) + P(\~A)P(\~B) \longrightarrow \frac{P(\~A \&amp; \~B)}{P(\~B)} = P(\~A) \longrightarrow \~A \perp \~B
 
{p^2+(1-p)^2}/{3p^2+(1-p)^2}
 
The above is the answer to the question
"Given " A says that B told him that C lied ".,what is the pr that c lied"
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top