0% found this document useful (0 votes)
54 views3 pages

MMW Notes

1) Math uses propositions to communicate ideas precisely. A proposition is a statement that can be identified as true or false. 2) There are simple and compound propositions. A simple proposition has one subject and one predicate, while a compound proposition combines two or more simple propositions using logical connectives like "if, then". 3) Truth tables show all possible truth values of a proposition. Conjunction uses "and" and is true only when both propositions are true. Disjunction uses "or" and is false only when both propositions are false.

Uploaded by

Levi Ackerman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
54 views3 pages

MMW Notes

1) Math uses propositions to communicate ideas precisely. A proposition is a statement that can be identified as true or false. 2) There are simple and compound propositions. A simple proposition has one subject and one predicate, while a compound proposition combines two or more simple propositions using logical connectives like "if, then". 3) Truth tables show all possible truth values of a proposition. Conjunction uses "and" and is true only when both propositions are true. Disjunction uses "or" and is false only when both propositions are false.

Uploaded by

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

MMW

Math is a language. We use propositions to communicate mathematical ideas precisely.

Proposition- declarative sentence. Can be identified as true or false but not both.

Notation: lowercase alphabet; p, q, r, s,…

p: The fish can walk. FALSE

If the proposition is true, its truth value is true, denoted by T or 1

false false, denoted by F or 0

Ex.

1. Douglas MacArthur arrived in the Philippines in 1521. – Proposition


2. Are you insane? – Not Proposition
3. Sq. root of 2 is an irrational number
4. Find all x such that xe^-x = 2
5. Is that your laptop? – Not Proposition
6. Basketball players are handsome. – Not Proposition
7. There is life in other planets. – Proposition
8. Welcome to the Philippines. – N

The Negation of a proposition p is the proposition not p which is false when p is true; and true when p is
false.

Notation: ~p

Ex.

P: Everyone in Visayas speaks Cebuano

~p: Not everyone in Visayas speaks Cebuano

Q: Today is Wednesday

~q: Today is not Wednesday

It is not true that today is Wednesday.

It is false that today is Wednesday.

Note: If the statement is true, the negation is false and vice versa.
Simple and compound proposition

Simple- one subject, one predicate

Ex: Every cat that barks has a phd.

Compound- combination of 2 or more simple propositions using logical connectives.

 If, then; if and only if

Truth table – shows all possible truth value of a proposition.

P
T
F
P Q
T T
T F
F T
F F

Let p and q be given propositions. The conjunction of p and q is proposition “p and q”, denoted by p^q,
which is true when both p and q are true.

P Q P^q
T T T
T F F
F T F
F F F

P: 3 is odd. T

Q: elephants are mammals T

R: Philippines is a first word country. F

P^q: 3 is odd and elephants are mammals. T

P^q^r: 3 is od, elephants are mammals, and Ph is a 1 st world country. F


Disjunction: “p or q” denoted by p(nakabaliktad na ^)q which is false only when both p and q are false.

P Q P or q
T T T
T F T
F T T
F F F
Conditional Statements: p -> q is the proposition “If p then q.” false only when p is true and q is false.

P – premise, assumption

Q – conclusion

S: the moon is made up of chocolate

Example: q -> r : If the elephants are mammals, then Ph is a first world country.

(p or q ) -> (q^r): If 3 is odd or elephants are mammals, then elephants are mammals and Ph is a
1st world country.

Biconditional: p <-> q to be read as “p if and only if q”. True when both p and q are true or both false.

Example: p: pi is an irrational number q: 3 is less than 2

Converse: If 3 is less than 2, then pi is an irrational number.

Inverse: If pi is not an irrational number, then 3 is not less than 2.

Contrapositive: If 3 is not less than 2, then pi is not an irrational number.

Implication: Tautology

Equivalent: papunta pabalik hahahaha 

Quantifiers and Negation

All x are y. negation -> some x are not y. Existential quantifiers: same, there exist,
least one

No x are y. negation -> some x are y. Universal quantifiers: all, every, none, no

Example: Write

You might also like