Scribd
Upload
13 views4 pages

L1 Logic

Uploaded by

roxannenivera04
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
13 views4 pages

L1 Logic

Uploaded by

roxannenivera04
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/ 4

Lesson 1: ​Algebra of Propositions

At the end of the session you will be able to

1. define basic logic terms;


2. translate verbal statements to symbols​;
3. translate logic symbols to verbal statements.

In mathematics, a ​proof ​is a demonstration that, assuming certain axioms, some


statement is necessarily true. That is, ​a proof is a logical argumen​t, not an empirical one.
One must demonstrate that a proposition is true in all cases before it is considered a
theorem of mathematics. An unproven proposition for which there is some sort of empirical
evidence is known as a ​conjecture​. Mathematical logic is the framework upon which
rigorous proofs are built. It is the study of the principles and criteria of valid inference and
demonstrations.

A proof in mathematics demonstrates the truth of certain ​statement. It is therefore


natural to begin with a brief discussion of statements. A ​statement, or proposition​, is the
content of an assertion. It is either true or false, but cannot be both true and false at the
same time.

Statements

1. Denoted by the letters ​p, q, r


2. It is either ​true​ or​ ​false​ but not both
3. The truthfulness or falsity of a statement is called the ​truth value
4. Composite ​statements are statements composed ​of ​substatements a ​ nd
connectives.

Examples:
1. Roses are red.
2. Violets are blue.
3. Roses are red and violets are blue.
4. Roses are red or violets are blue.
5. Roses are not red.

NEGATION, denoted by ¬ or ～

Given any statement ​p​, another statement called the ​negation of p ​ can be formed
by writing: “it is false that…” or “It is not true that …” before o or if possible by inserting in p
the word “not”. Symbolically the negation of p is denoted by ​¬p or ～p .

Examples:
1. p: Roses are red.
～p : It is false that roses are red.
Another way of stating this is, “It is not true that roses are red.” or “Roses are not red.”

2. q: Paris is in France.
～q: It is false that Paris is in France.
​Another way of stating this is, “It is not true that Paris is in France.” or “Paris is not in France.”

CONJUNCTION, denoted by ∧

Any two statements can be combined by the word “and” to form a composite
statement which is called the ​conjunction of the original statements. Symbolically, the
conjunction of the two statements p and q is denoted by​ p​ ​∧ q

Example: p: Roses are red.


q: Violets are blue.
​ c: Roses are red and violets are blue
p​ ​∧ ～q: Roses are red and violets are not blue.

DISJUNCTION, denoted by ∨

Any two statements can be combined by the word “or” to form a composite statement
which is called the ​disjunction of the original statements. Symbolically, the conjunction of
the two statements p and q is denoted by​ p​ ​∨ q

Example: p: He studied Spanish at the university.


q: He lived in Spain.
​p​ ​∨ q: He studied Spanish at the university or he lived in Spain.

CONDITIONAL, denoted by ​➜

Many statements, especially in mathematics are of the form “If p then q”. Such
statements are called ​conditional​ statements and are denoted by p ​ ​➜ q.

It can also be read as


a) p ​implies​ q
b) p ​only if​ q
c) p ​is sufficient for​ q
d) q​ is necessary for​ p

Example: Given ​p​: Paris is in France. ​q​: 2 + 2 = 4


a) If Paris is in France then 2 + 2 = 4 , write in symbols.
Ans​: p ​ ​➜ q

b) Paris is in France only if 2 + 2 ≠ 4.


Ans. p ➜ ​～q

BICONDITIONAL, denoted by ⟷

Another common statement is of the form “​p if and only if q​” or simply “​p iff q​”. Such
statements are called​ biconditional statements​ and are denoted by ​p​ ​⟷ q .

Examples:

1. Given p: Paris is in France. q: 2 + 2 = 4

Write in words:

a) p​ ​⟷ q
b) ​～q ⟷ p
c) (p​ ​⟷ q) ∧ ～(​ ​p​ ​∨ q)

Answers:
a) Paris is in France if and only if 2 + 2 = 4
b) 2 + 2 ≠ 4 if and only if Paris is in France.
c) Paris is in France if and only if 2 + 2 = 4 and it is not true that Paris is in France or
2 + 2 = 4.

2. Given p: Ann is a mathematician q: She wins the olympics.


Write in symbols:

a) Ann is a mathematician if and only if she wins the olympics.


b) Ann is not a mathematician or Ann is a mathematician if and only if she does not win
the olympics.

Answers:
a) p ​⟷ ​q
b) ～p ​ ​∨ ( ​p ​⟷ ～​q)

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