Scribd
Upload
11 views3 pages

Symbolic-Arguments

The document explains the structure of symbolic arguments, including premises and conclusions, and defines validity in terms of truth tables. It provides examples of valid and invalid arguments, standard forms of reasoning, and common fallacies. Additionally, it discusses the use of Euler diagrams to determine argument validity and introduces cryptarithms as a logical puzzle-solving method.

Uploaded by

Samantha Abitria
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views3 pages

Symbolic-Arguments

The document explains the structure of symbolic arguments, including premises and conclusions, and defines validity in terms of truth tables. It provides examples of valid and invalid arguments, standard forms of reasoning, and common fallacies. Additionally, it discusses the use of Euler diagrams to determine argument validity and introduces cryptarithms as a logical puzzle-solving method.

Uploaded by

Samantha Abitria
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Symbolic Arguments

An argument consists of a set of statements called premises and another statement called the
conclusion. An argument is valid if the conclusion is true whenever all the premises are assumed to be
true. An argument is invalid if it is not a valid argument.

Example:
If Leonardo Fibonacci was human, then he was mortal. LF was human. Therefore, he was mortal.

1st Premise: If LF was human, then he was mortal.


2nd Premise: LF was human.__________________
Conclusion: Therefore, LF was mortal.

In symbolic form:
Let h represents the statement “Leonardo Fibonacci was human” and m represents “LF was
mortal.”

ℎ →𝑚
ℎ_______
∴ 𝑚

Is the argument valid? We will use truth table.

First Premise Second Premise Conclusion


h m h m
T T
T F
F T
F F

Example:
If it rains, then there will no classes. It is not raining. Therefore, there will be classes.

First Premise Second Premise Conclusion

T T
T F
F T
F F

Determine the Validity of the Argument

Ex. If I finish the problem set before midnight, then I can submit it before noon.
If I can submit the problem set before noon, then I can take the exam.
Standard Forms:
Direct Contrapositive Transitive
Disjunctive Reasoning
Reasoning Reasoning Reasoning
𝑝→𝑞 𝑝→𝑞 𝑝→𝑞 𝑝∨𝑞 𝑝∨𝑞
𝑝 ~𝑞 𝑞→𝑟 ~𝑝 ~𝑞
∴𝑞 ∴ ~𝑝 ∴𝑝→𝑟 ∴𝑞 ∴𝑝

Examples:
1. If Maria is a Doctor, then she will be able to help us. Maria is not able to help us.
2. If they had a good time, they will return home. If they’ll return home, we will prepare dinner.
3. If you can dream, you can do it. You can dream it.
4. I bought a car or I bought a motorcycle. I did not but a motorcycle.

Some fallacies:
Standard Forms of Two Invalid Arguments
Fallacy of the Converse Fallacy of the Inverse
𝑝→𝑞 𝑝→𝑞
𝑞 ~𝑝
∴𝑝 ∴ ~𝑞

Examples:
1. If I have a fever, then I find it difficult to sleep. I find it difficult to sleep.
Therefore, I have a fever.
2. If I go to Manila for the summer break, then I will not enroll for summer.
I did not go to Manila. Therefore, I enrolled.
3. If you helped your classmate do the problem set, then you should be rewarded.
You helped your classmate. Therefore, you should be rewarded.

Determine a valid conclusion for the argument

Use all premises to determine a valid conclusion for the argument.


We will go to China or we will go to Macau. If we visit my uncle, then we will go to Singapore.
If we go to Macau, then we will not go to Singapore.

Try this:
~𝑚 ∨ 𝑡
𝑡 → ~𝑟
𝑠∨𝑞
𝑠→𝑟
∴ ?

Arguments and Euler Diagrams

All Ps are Qs. No Ps are Qs. Some Ps are Qs. Some Ps are not Qs.
P Q P Q P Q
Q P
Use an Euler Diagram to Determine the Validity of an Argument
1. All Mathematics subjects are fun. MMW is a math subject. Therefore, MMW is fun.
2. All doctors drive Porsche. Mickey is doctor. Therefore, Mickey drives Porsche.
3. No prime numbers are negative. The number 7 is not negative. Therefore, the number 7 is a
prime number.
4. No engineer can juggle. All clowns can juggle. Therefore, no engineer is a clown.
5. No mathematics professors are good-looking. All good-looking people are models. Therefore,
no mathematics professor is a model.

Euler Diagrams and Transitive Reasoning

Example:
All good in math are good-looking. All good-looking are models. All models are rich.
Therefore, all good in math are rich.

healthy foods

delicious foods

greasy foods

Fried
foods

1. All Ms are Ns. No Ns are Ps. Therefore, ______.


2. Some rabbits are white. All white animals are like apples. Therefore, _____.

Using logic to Solve Cryptarithms


Many puzzles can be solved by making an assumption and then checking to see if the
assumption is supported by the conditions (premise) associated with the puzzle. When working
with Cryptarithms, assume that the leading digit of each number is a nonzero digit.

Example:
1. TA+BT=TEE
2. SO +SO=TOO
3. COLA+COLA=OASIS
4. US +AS=ALL

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy