1015SCG
Lecture 7
Inductive reasoning: Experiences (A) imply a general rule (B)
Deductive reasoning: Assumptions (A) imply logical consequence (B)
⭐️ Deductive reasoning preserves truth — but only if the premises are true.
Abductive reasoning: All our experiences (A) imply the simplest general principles
Example:
If it is raining, the ground will be wet.
The ground is wet.
Therefore, it must be raining.
If it is raining, then the ground is wet.
We can chain implications:
If it is raining, then the ground is wet.
If the ground is wet, then Monty does not want to go out.
Hence, if it is raining, then Monty does not want to go out.
Consider the following statements:
Are the following statements true?
If I live in Gold Coast, then I live in Australia.
If you pass the exam, then you had sat the exam.
A quadrilateral is a square ⇔ it has four equal sides and four right angles.
A quadrilateral has four equal sides and four right angles ⇔ it is a square.
Relationships between statements A and B:
| Relationship | Symbolic form | Notes / equivalent |
|---|---|---|
|
A necessary but not sufficient for B |
\( (B \Rightarrow A)\;\land\;\lnot(A \Rightarrow B) \) |
B implies A, but A does not imply B. |
|
A sufficient but not necessary for B |
\( (A \Rightarrow B)\;\land\;\lnot(B \Rightarrow A) \) |
A implies B, but B does not imply A. |
| A equivalent to B |
\( A \iff B \) (or \( (A\Rightarrow B)\land(B\Rightarrow A) \)) |
Both implications hold: A iff B. |
|
A neither necessary nor sufficient for B |
\( \lnot(A \Rightarrow B)\;\land\;\lnot(B \Rightarrow A) \) | Neither implication holds. |
Note: The symbol "\(\,\lnot\,\)" means "not".
If it is raining then the ground is wet.
Does not imply that: If the ground is wet then it is raining.
If it is raining then the ground is wet.
Does not imply that: If it is NOT raining then the ground is dry.
If you are not with us, you are against us.
Example:
Consider the statement: When it is raining, the ground is wet.
Which of the following is logically consistent with this statement?
Are the following statements true?
|
|
This statement is FALSE
If it is true, then it must be false;
if it is false, then it must be true.
Therefore, it cannot be classified as either true or false.
This statement is FALSE
If it is true, then it must be false;
if it is false, then it must be true.
Therefore, it cannot be classified as either true or false.
The sentence:
This statement is FALSE
is a self-referential statement.
It talks about its own truth value.
This statement is FALSE
Classical logic assumes:
But this sentence breaks that rule.
It creates a contradiction.
The paradox dates back to ancient Greece.
It is often attributed to Epimenides of Crete (~6th-century BC).
He reportedly said:
“All Cretans are liars.”
If he was Cretan, was he telling the truth?
The Liar Paradox influenced modern logic.
It relates to:
Is it possible to overcome these logical issues? 🤔
|
Three Volumes |
|
This proof was presented after writing more than 350 pages of theory! 🤯
Hola, this is a secret message!
In 1931, the mathematician Kurt Gödel proved two remarkable results about mathematics.
First Theorem: To every $\omega$-consistent recursive class $c$ of formulae there correspond recursive class-signs $r,$ such that neither $v\,\text{Gen}\,r$ nor $\text{Neg}(v\,\text{Gen}\,r)$ belongs to $\text{Flg}(c)$ (where $v$ is the free variable of $r$).
Second Theorem: If $c$ be a given recursive, consistent class of formulae, then the propositional formula which states that $c$ is consistent is not $c$-provable; in particular, the consistency of $\text{P}$ is unprovable in $\text{P}$, it being assumed that $\text{P}$ is consistent (if not, of course every statement is provable).
In 1931, the mathematician Kurt Gödel proved two remarkable results about mathematics.
In any logical system that is powerful enough to describe basic arithmetic:
First Theorem:
There are true mathematical statements that cannot be proved within the system.
Second Theorem:
Such a system cannot prove that it is free of contradictions (cannot prove its own consistency).
👉 In simple terms: No sufficiently powerful mathematical system can be both complete (prove all truths) and self-certifying (prove it is consistent).
A 🐊 crocodile steals a child from a mother on the banks of the Nile. When the mother begs for the child's return, the crocodile makes a deal:
"If you correctly predict what I will do with the child, I will return it. If you predict incorrectly, I will eat it."
The mother replies:
"You will eat my child."
Example: "I have used STDEV.S function on the number of possums data to find the standard deviation."
If you use a programming language to make some computations, you can comment it in your document and add the full code as an Appendix.
x = (0:0.25:1);
for j = 1:100
t = j/25;
z = sin(pi * x) * cos(2 * pi * t);
plot(x, z); axis([0,1,-1,1]);
M(j) = getframe;
end
See you in Week 8!