∧: stands for and, if both a and b are true, they are true ∨:stand for or, if a is true or b is true, ther are true ¬: stand for not, if a is true, then a is false, vice versa. ⟹:stands for implies, if a⟹bis true then when a is true, b will only be false, while when a is false, b can be either one. ⟺: stand for "if and only if" if a⟺b≡(a⟹b)∧(b⟹a)
For example, Try to prove following argument are valid:
Taxes will increase or government spending decrease. Government spending increases or more people have jobs. If people are poor or the economy is bad, then fewer people will have jobs. Therefore, if taxes decrease, people are rich.
First , let's let I=Taxes will invrease G=Government spending decreases J=More people have jobs P=Prople are rich E=Economy is bad
Then you will have following proposition:
⎩⎨⎧1.I∨G2.¬G∨J3.¬P∨R⟹¬J
The conclusion will be ¬I⟹P
To solve it, first let I=F.
From 1. We know G=T
Then, We can found J=T,
Form 3. We can deduce J⟹P∧¬R,henceP∧¬R=T
so P=T∧¬R=T
Finally we can claim that ¬I⟹P
There are many job vacancies and the unemployment rate is low. If there are many job vacancies, then either the economy is thriving or wages are too low. If wages are not too low, then the unemployment rate is low. Therefore, the economy is thriving.
Let :
J = There are many job vacancies,
U = Unemployment rate is low
E = The economy is thriving
W = wages are too low
We have following proposition: 1.J∧U 2.J⟹E∨W 3.¬W⟹U
And conclusion is E
Let E=False ¬E∧¬W⟹¬J
let W=True ¬J=False,J=True ¬W⟹U=True,U=True J∧U=True
Hence, there exist a case that E=False, the case is invalid.
We use induction to prove some theory is whether true.
It involves three steps:
State out a theorem.
Prove that an base case is true. (e.g. P(0))
Prove that P(n)⟹P(n+1)=True
For example, we try to prove $$\forall x \geq 0, 1+2+3+.....+n = \frac {n(n+1)} {2}$$
Indeed, this is what the gaussian summation is:
∀x≥0,i=1∑ni=2n(n+1)
So, for the Proof, Let's try to prove P(0) is true for the theorem: P(0)=20(n+1)=0 , Which is True.
Then, We are going to proof P(n)⟹P(n+1) is True
Let's assume P(n) is True for the purpose of induction: P(n)=2n(n+1)=True
If P (n) = True, Then how about P (n+1)? Let's see: P(n+1)=∑i=1n+1i=P(n)+(n+1)=2n(n+1)+n+1=2n2+3n+2=2(n+1)(n+2), Which is true.
Such that, P(n)⟹P(n+1) stands.
And as P (0) is true, we successfully prove that ∀x≥0,1+2+3+.....+n=2n(n+1)