Scribd
Upload
82 views13 pages

Fundamentals of Logic

This document outlines the key concepts to be covered in a course on fundamentals of logic. It discusses propositions, the five basic connectives (and, or, if-then, if and only if, not), truth tables, propositional functions, and logical equivalencies. Specifically, it defines propositions as declarative sentences that can be true or false, introduces the connectives and their notations, provides truth tables for conjunction, disjunction and implication, defines propositional functions, and discusses equivalent, tautology, contradiction and contingency.

Uploaded by

Pratham Jain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
82 views13 pages

Fundamentals of Logic

This document outlines the key concepts to be covered in a course on fundamentals of logic. It discusses propositions, the five basic connectives (and, or, if-then, if and only if, not), truth tables, propositional functions, and logical equivalencies. Specifically, it defines propositions as declarative sentences that can be true or false, introduces the connectives and their notations, provides truth tables for conjunction, disjunction and implication, defines propositional functions, and discusses equivalent, tautology, contradiction and contingency.

Uploaded by

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

MATH F213

FUNDAMENTALS OF
LOGIC
BITS Pilani Michael Alphonse
Hyderabad Campus
The topic to be covered

1. Propositions
2. Five basic connectives

BITS Pilani, Hyderabad Campus


Definition of Proposition

Sentences

Declarative Exclamatory Interrogative Imperative


Here we consider only declarative sentences which can be
assigned only one truth value : true or false
Declarative sentences are called propositions.

BITS Pilani, Hyderabad Campus


Five Basic Connectives

Connectives Notation(Let p and q be two propositions)

1.And ⋀ p⋀q (conjunction)


2. Or ⋁ p⋁q (disjunction)
3. If …. then → p → q (implication)
(Here p is called premise or hypothesis or antecedent
q is called conclusion or consequent)
4. If and only if ↔ p ↔ q (implies and implied by)
5. Not ∼ ∼p (not p)

BITS Pilani, Hyderabad Campus


Basic Assumptions

Assumption 1 (The law of excluded middle): For every


proposition p, either p is true or p is false.
Assumption 2 (The law of contradiction): For every
proposition p, it is not the case that p is both true and
false.

BITS Pilani, Hyderabad Campus


Truth Tables for and, or,
implies

p q p⋀q p q p⋁q
T T T T T T
T F F T F T
F T F F T T
F F F F F F

p q P→q
T T T
T F F
F T T
F F T

BITS Pilani, Hyderabad Campus


Propositional Function

Propositional Function is a function whose variables are


propositions. For example, [(p⋀(∼q))⋁r]→p is a
propositional function of three variables. Truth table for
this function :
p q r ∼q p⋀(-q) [(p⋀(∼q))⋁r] [(p⋀(∼q))⋁r]→p

F F F T F F T
F F T T F T F
F T F F F F T
F T T F F T F
T F F T T T T
T T F F F F T
T F T T T T T
T T T F F T T

BITS Pilani, Hyderabad Campus


Equivalent, Tautology,
Contradiction, Contingency
1. If truth table of two propositional functions are the same,
then we say that they are logically equivalent or simply
equivalent. Example : p → q and (∼p)⋁q are equivalent.
2 A tautology is a propositional function whose truth value is
true for all possible values of the propositional variables.
Example : ∼p ⋁ p
3. A contradiction or absurdity is a propositional function
whose truth value is always false. Example : ∼p ⋀ p
4. A propositional function which is neither a tautology nor a
contradiction is called a contingency.

BITS Pilani, Hyderabad Campus


Counting the number of 2
Proposition functions
Since for each truth table we have four rows are to be filled up, there
are 24 = 16 possible 2 proposition functions.

Column 2 corresponds to ⋁(OR) and column 8 to ⋀ (AND). Like this we


can find the connectives for each column which is given in the following
slide.

BITS Pilani, Hyderabad Campus


Here p←/→q denotes ∼(p↔q) and p−/→q denotes ∼(p→q).

BITS Pilani, Hyderabad Campus


Using connectives, we can generate more than sixteen 2
proposition function. Those will be equivalent to one of
these sixteen 2 proposition functions. Examples :

The converse of p → q is q →p.


The opposite of p → q is (∼p) → (∼q).

BITS Pilani, Hyderabad Campus


The following truth table proves the law of contrapositive.

Explanations of Implications and contrapositive.

BITS Pilani, Hyderabad Campus


BITS Pilani, Hyderabad Campus

You might also like