Scribd
Upload
21 views3 pages

Logic

University Mathematics I: Olaniyi Evans

Uploaded by

Olaniyi Evans
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
21 views3 pages

Logic

University Mathematics I: Olaniyi Evans

Uploaded by

Olaniyi Evans
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

2

LOGIC

CONTENTS
Propositional Logic 19
Truth Table 20
Connectives and Operations between Propositions 20
Types of Statements 21
Inverse, Converse, and Contrapositive 22
Universal and existential quantifiers 22
Negation of Propositions 22
Methods of Proofs 23
Duality Principle 23

Logic is the study of the methods and principles of correct reasoning.


Logic is a fundamental tool used across various fields:
• Lawyers and Business People: To construct valid arguments, analyze legal
contracts, and solve complicated problems.
• Computer Programmers: To design software.
• Engineers: To design electronic circuits.
• Mathematicians: To solve problems and construct mathematical proofs.
When people say ‘logic’, they mean either propositional logic or first-order
predicate logic. The simplest and most abstract logic is propositional logic.

PROPOSITIONAL LOGIC
Propositional logic, also known as sentential logic or statement logic, is
a branch of logic which deals with propositions and their interrelationships. A
proposition is a statement which is either true or false. The term proposition is
sometimes used synonymously with statement. There are two logical values: true
and false, denoted by T and F, respectively.

Examples of propositions: The following are non-propositions:


• The car is on. • Are you going out today?
• The book is open. • 1+2 (This is a mathematical
• Sir Sigma is the president. expression, not a statement.)
• 2026 + 10 = 2036 • Five miles from the university

To determine whether any given statement is a proposition, prefix it with: “It is


true that ...” Check whether the result makes grammatical sense. Rather than
write out propositions in full, they are abbreviated using propositional variables;
they are denoted by small letters (p, q, r, ...).

Further examples of propositions:


p: = Man is mortal.
The logical value of the proposition p is true.

q: = If 𝑥 = −1 then 𝑥 2 + 1 = 0.
The logical value of the proposition q is false.
20 Olaniyi Evans | University Mathematics

TRUTH TABLE
The truth table is used to show whether a proposition is logically valid. It has
one column for each proposition (for example, p and q), and one final column
showing all of the possible results of the logical operation that the table
represents. Each row contains one possible configuration of the propositions
(e.g., p = true, q = false), and the result of the operation for those values.
Table 2.1 Truth Table
Relation p T T F F
q T F T F
conjunction 𝑝 ∧ 𝑞 T F F F
disjunction 𝑝 ∨ 𝑞 T T T F
implication 𝑝 ⇒ 𝑞 T F T T
equivalence 𝑝 ⇔ 𝑞 T F F T

CONNECTIVES AND OPERATIONS BETWEEN


PROPOSITIONS
Negation: (denoted by ~, called ”not”)
The negation of a proposition p is defined by
true, if 𝑝 is false
~𝑝: = {
false, if 𝑝 is true
That is, if p is true, then ~p is false; if p is false, ~p is true.

Example: p: The President is coming The truth table for negation looks like
today. this:
~𝑝: The President is not p ~𝑝
coming today. T F
F T

Conjunction: (denoted by ∧, called ”and”)


The conjunction of propositions p and q is defined by
true, if 𝑝 and 𝑞 are both true
𝑝 ∧ 𝑞: = {
false, if at least one of 𝑝 and 𝑞 is false
That is, it is true when, and only when, both p and q are true. If either p or q is
false, or if both are false, p ∧ q is false.

Example: p: Today is Sunday. The truth table for conjunction looks


q: It is raining today. like this:
p ∧ q: Today is Sunday and
it is raining today. p q 𝑝∧𝑞
This proposition is true only on rainy T T T
Sundays and is false on any other T F F
rainy day or on Sundays when it does F T F
not rain. F F F

Disjunction: (denoted by ∨, called ”or”)


The disjunction of propositions p and q is defined by
true, if at least one of 𝑝 and 𝑞 is true
𝑝 ∨ 𝑞: = {
false, if 𝑝 and 𝑞 are both false
That is, it is true when at least one of p or q is true and is false only when both p
and q are false.
Chapter 2| Logic 21

Purchase the full book at:

https://unimath.5profz.com/

We donate 0.5% of the book sales


every year to charity, forever. When
you buy University Mathematics (I &
II) you are helping orphans and the
less privileged.

You might also like