6 Propositional Logic N Categorical 3to5 Slides PDF

Propositional Logic & Propositional calculus
Propositional Logic, Calculus & Categorical Statements
Vineet Sahula
sahula@acm.org
Department of ECE
Malaviya National Institute of Technology
Formal Verification- HW & SW Even 2019
V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 1 / 64

Outline

Todayś Lecture: Propositional Logic, 28-Feb-2019

Outline of Part- 1: Propositional Logic
1 Argument Forms
2 Logical Operators
3 Formalization
4 Semantics of the Logical Operators
5 Truth Table for Wffs
6 Truth Tables for Argument Forms
7 Refutation Trees

Argument Forms
Outline
1 Argument Forms
2 Logical Operators
3 Formalization
7 Refutation Trees

Argument Forms
Arguments Forms
• Formal Logic
• Study of argument forms
• Abstract patterns of reasoning

Argument Forms
Arguments Forms

Argument Forms
Arguments Forms

Argument Forms
Arguments Forms

Argument Forms
Arguments Forms
' $
& %

Argument Forms
Arguments Forms

Argument Forms
Arguments Forms

Argument Forms
Arguments Forms
' $
& %

Argument Forms
Arguments Forms

Argument Forms
Arguments Forms

Argument Forms
Arguments Forms

Argument Forms
Arguments Forms

Logical Operators
Outline
1 Argument Forms
2 Logical Operators
3 Formalization
7 Refutation Trees

Logical Operators
Logical Operators
Operators
Logical opertor Symbol
It is not the case that ∼
And &
EIther ... or ∨
If ... then →
If and only if ↔
∴ `

Logical Operators
Logical Operators
Operators
And &
EIther ... or ∨
If ... then →
If and only if ↔
∴ `

Logical Operators
Logical Operators
Operators
And &
EIther ... or ∨
If ... then →
If and only if ↔
∴ `

Logical Operators
Logical Operators
Operators
And &
EIther ... or ∨
If ... then →
If and only if ↔
∴ `

Logical Operators
Logical Operators
Operators
And &
EIther ... or ∨
If ... then →
If and only if ↔
∴ `

Logical Operators
Logical Operators
Operators
And &
EIther ... or ∨
If ... then →
If and only if ↔
∴ `

Logical Operators
Logical Opertors
' $
& %

Logical Operators
Logical Opertors

Formalization
Outline
1 Argument Forms
2 Logical Operators
3 Formalization
7 Refutation Trees

Formalization
Formalization
1 Ealier, we studied- Language of propositional Logic

2 Now, Symbolic formulae for this language
1 Sentences being Formalized
2 State the Grammatical rules Formation rules

Formalization
Formalization


Formalization
Formalization


Formalization
Formalization


Formalization ...
Sentence Formalization
Today is Monday M
Today is Tuesday T
Today is NOT Monday ∼M
Today is NOT Monday, and today is Tuesday ∼M &T
Today is NOT both Monday and Tuesday ∼ (M&T)
Eithertoday is Monday, ortoday is Tuesday and election day M ∨ (T & E)
Formalization ...
Today is Monday M
Today is Tuesday T
Formalization ...
Today is Monday M
Today is Tuesday T
Formalization ...
Today is Monday M
Today is Tuesday T
Formalization ...
Today is Monday M
Today is Tuesday T
Formalization
Formalization
' $
& %

Formalization
Formalization

Formalization
Formalization


Formalization
Formalization

Formalization
Formalization
Example
• Vocabulary of Language of propositional logic, are following
symbols
• Sentence letters
• Logical operators
• Brackets

Formalization
Formalization

Formalization
Formalization
• A formula is any sequence of these three elements

• This sequence may be full of sense OR nonsense
• We have concept to differentiate among these- Well Formed
Formula (Wff)

Formalization
Formalization
Formula Rules

Formalization
Formalization
Complex Wffs

Formalization
Formalization: Examples
' $
& %

Formalization

Formalization
' $
& %

Formalization

Formalization

Formalization
' $
& %

Formalization
' $
& %

Formalization
' $
& %

Formalization
' $
& %

Semantics of the Logical Operators
Outline
1 Argument Forms
2 Logical Operators
3 Formalization
7 Refutation Trees

Semantics of Logical Operators



Logical operator →
• P→Q
• ∼ (P & ∼ Q)
• Venn Diagram







Logical operator ↔
• P↔Q
• P → Q as well as Q → P


T F F T


Truth Table for Wffs
Outline
1 Argument Forms
2 Logical Operators
3 Formalization
7 Refutation Trees

Wffs- Truth Tables

Wffs- Truth Tables

Wffs- Truth Tables

Wffs- Truth Tables

Wffs- Truth Tables

Truth Tables for Argument Forms
Outline
1 Argument Forms
2 Logical Operators
3 Formalization
7 Refutation Trees

Truth Tables- Argument Forms




Refutation Trees
Outline
1 Argument Forms
2 Logical Operators
3 Formalization
7 Refutation Trees

Refutation Trees
Refutation Trees

Refutation Trees
Refutation Trees

Refutation Trees
Refutation Trees

Refutation Trees
Refutation Trees

Refutation Trees
Refutation Trees

Refutation Trees
Refutation Trees
Refutation is FAILED hence, this form is VALID

Refutation Trees
Examples- Refutation Trees

Refutation Trees

Refutation Trees

Refutation Trees

Refutation Trees
Refutation Trees: Categories of Wffs

Refutation Trees

Refutation Trees
(1) Negation (∼)

Refutation Trees
(2) Negated Negation (∼∼)

Refutation Trees
(3) Conjunction (&)

Refutation Trees
(4) Disjunction (∨)
Each path of tree is prescription for constructing counterexamples.

Refutation Trees
(4) Disjunction- Ex. P ∨ Q, P ` ∼ Q

Refutation Trees
Refutation Trees: Conditional
(5) Conditional (→)

Refutation Trees
Refutation Trees: Conditional
(5) Conditional (→)

Refutation Trees
Refutation Trees: Biconditional
(6) Biconditional (↔)

Refutation Trees
Refutation Trees: Biconditional
(6) Biconditional (↔)

Refutation Trees
Refutation Trees: Negated Conjunction
(7) Negated Conjunction (∼ &)

Refutation Trees
Refutation Trees: Negated Conjunction
(7) Negated Conjunction (∼ &)

Refutation Trees
Refutation Trees: Negated Disjunction
(8) Negated Disjunction (∼ ∨)

Refutation Trees
Refutation Trees: Negated Disjunction
(8) Negated Disjunction (∼ ∨)

Refutation Trees
Refutation Trees: Negated Conditional
(9) Negated Conditional (∼→)

Refutation Trees
Refutation Trees: Negated Conditional
(9) Negated Conditional (∼→)

Refutation Trees
Refutation Trees: Negated Biconditional
(10) Negated Biconditional (∼↔)

Refutation Trees
Refutation Trees: Negated Biconditional
(10) Negated Biconditional (∼↔)

Refutation Trees
Refutation Trees: Tautologousness
(?) Tautology

Refutation Trees
(?) Tautology

Refutation Trees
(?) Tautology

Refutation Trees
Refutation Trees: General Rules
Rule- 1

Refutation Trees
Rule-2

Refutation Trees
Rule-3

Refutation Trees
Todayś Lecture: Propositional Calculus,

13-March-2019

Outline of Part- 2: Propositional Calculus

Propositional Calculus
• The notion of inference

• Nonhypothetical inference rules
• Hypothetical rules
• Derived Rules
• Theorems
• Equivalences

The notion of inference
Inference



Nonhypothetical inference rules
• Elimination ( E)
• Conditional elimination (→ E)
• Negation elimination (∼ E)
• Conjunctionl elimination (&E)
• Disconjunction elimination (∨E)
• Biconditional elimination (↔ E)
• Introduction ( I)
• Conjunction introduction (&I)
• Disconjunction introduction (∨I)
• Biconditional Introduction (↔ I)

Conditional elimination (→ E)

Negation elimination (∼ E)

Conjunction Rules
Conunction
Conjunction Introduction (&I)

Conjunction Rules
Conunction
Conjunction Introduction (&I) ...

Conjunction Rules
Conunction
Conjunction Introduction (&I)...

Conjunction Rules
Conunction
Conjunction Introduction (&I)

Disjunction Rules
Disjunction
Disjunction Introduction (∨I)

Disjunction Rules
Disjunction
Disjunction Introduction (∨I) ...

Disjunction Rules
Disjunction
Disjunction Elimination (∨E)...

Disjunction Rules
Disjunction
Disjunction Elimination (∨E)

Biconditional Rules
Biconditional
Biconditional Rules

Biconditional Rules
Biconditional
Biconditional Introduction (↔ I) ...

Biconditional Rules
Biconditional
Biconditional Introduction (↔ I)...

Biconditional Rules
Biconditional
Biconditional Elimination (↔ E)

Hypothetical rules
Hypothetical Rules
• Conditional Introduction
• Negation Introduction

Hypothetical rules

Hypothetical rules

Hypothetical rules

Hypothetical rules
Conditional Introduction (→ I)...

Hypothetical rules
Conditional Introduction (→ I)...

Hypothetical rules
Important Guidelines

Hypothetical rules
Negation Introduction (∼ I)

Hypothetical rules
Negation Introduction (∼ I)...

Hypothetical rules
Proof Strategies

Derived Rules
• Substitution (Modus Tollens- MT)

• Hypotheical Syllogism (HS)
• Absorption (ABS)
• Constructive Dilemma (CD)
• Repeat or Reiteration (RE)
• Contradiction (CON)
• Disjunctive Syllogism (DS)

Theorems

Theorems
redutio ad absurdum

Theorems
redutio ad absurdum

Theorems
Theorem Introduction (TI)

Theorems
Theorem Introduction (TI)

Equivalences

Equivalences

Equivalences
Equivalences
• De-Morgan’s Law (DM)
• Commutation (COM)
• Association (ASSOC)
• Distribution (DIST)
• Double negation (DN)
• Transposition (TRANS)
• Material Implication (MI)
• Exportation (EXP)
• Tautology (TAUT)

Equivalences

Equivalences

Todayś Lecture: Categorical Statements,
20-March-2019

Quiz-2
Problem Statement-1
Do (2), (5) and (12)

Quiz-2 ...
Problem-set-2

Quiz-2 ...
Problem-set-3

Todayś Lecture: Categorical Statements,
20-March-2019

Outline of Part- 3: The Logic of Categorical
Statements
8 Categorical statements
9 Venn Diagrams
10 Immediate Inferences
11 Categorical Syllogism

Categorical statements
Outline
9 Venn Diagrams

Expressions including- all, some and none

Introduction- Why use it?

Formulation

Example

Designations

Venn Diagrams
Outline
9 Venn Diagrams

Venn Diagrams
Vennn Diagrams
• Visualizing gategorical statement using Venn Diagram

• Two overlapping circles
• Cirle ONE for Subject, circle TWO for Predicate
• Area inside the circle- Contents of the SET
• Area outside the circle- Contents of complement of SET
• Area overlapping between the circles- Members corresponding to
SETs share
• To show SET or part of SET, has no members-
• Block out the part of diagram representing it

Venn Diagrams
Vennn Diagrams
No S are P
Formulation-1

Venn Diagrams
Vennn Diagrams
All S are P
Formulation-2

Venn Diagrams
Vennn Diagrams
Some S are P
Formulation-3

Venn Diagrams
Vennn Diagrams
Some S are not P

Formulation-4

Venn Diagrams
Venn Diagrams: Examples

Venn Diagrams

Venn Diagrams

Venn Diagrams

Venn Diagrams

Venn Diagrams

Immediate Inferences
Outline
9 Venn Diagrams

• Inferences from one categorical statement to another are called immediate

inferences
• Venn Diagrams can be used for checking validity of immediate inference forms
• If two statements forms have exactly the same diagram →they are logically
equivalent
• ’∼(All S are P)’ is equivalent to ’Some S are P’
• ’∼(Some S are P)’ is equivalent to ’All S are P’
• Any pair of A- and O-form statements with same S and P, are contradictories
• One form results by exchangin the Subject and Predicate terms- S and P,
areconverses
• Valid for E- and I-forms, NOT valid for A- and O-forms
• (All S are P)’ is converse to ’All P are S’
• (Some S are P)’ is converse to ’Some P are S’

Converse is valid for form E

Converse is invalid for form A

Contraposition is invalid for form E

Contraposition is valid for form A

Describing categorical forms by quality and quantity

Categorical Syllogism
Outline
9 Venn Diagrams

• Immediate inferences are ONE-premise arguments

• where, premise & conclusion are both Categorical statements
• Categorical Syllogismsare TWO-premise arguments consisting entirely of
• Conclusion Argument contains exactly three class terms-
• Subject and predicate term of conclusion (minor and major terms of
syllogism)
• Third term (the middle term), wgich occurs in both premises



Categorical Syllogism- Examples








References
• J. Nolt, D. Rohatyn and A. Varzi- Logic, Schaum Outline series

• James L. Hein. Discrete Structures, Logic & Computability, Jones
& Barlett
• M. Huth and M. Ryan, Logic in Computer Science- Modeling &
Reasoning in Systems, Cambridge University Press.

6 Propositional Logic N Categorical 3to5 Slides PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

6 Propositional Logic N Categorical 3to5 Slides PDF

Uploaded by

Copyright:

Available Formats

Propositional Logic & Propositional calculus

Propositional Logic, Calculus & Categorical Statements

Formal Verification- HW & SW Even 2019

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 1 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 2 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 3 / 64

4 Semantics of the Logical Operators

5 Truth Table for Wffs

6 Truth Tables for Argument Forms

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 4 / 64

4 Semantics of the Logical Operators

5 Truth Table for Wffs

6 Truth Tables for Argument Forms

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 5 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 6 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 6 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 6 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 6 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 6 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 6 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 6 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 6 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 6 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 6 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 6 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 6 / 64

4 Semantics of the Logical Operators

5 Truth Table for Wffs

6 Truth Tables for Argument Forms

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 7 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 8 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 8 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 8 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 8 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 8 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 8 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 9 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 9 / 64

4 Semantics of the Logical Operators

5 Truth Table for Wffs

6 Truth Tables for Argument Forms

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 10 / 64

1 Ealier, we studied- Language of propositional Logic

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 11 / 64

1 Ealier, we studied- Language of propositional Logic

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 11 / 64

1 Ealier, we studied- Language of propositional Logic

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 11 / 64

1 Ealier, we studied- Language of propositional Logic

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 11 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 13 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 13 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 13 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 13 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 13 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 13 / 64

• A formula is any sequence of these three elements

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 13 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 13 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 13 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 14 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 14 / 64

V. Sahula (MNIT Jaipur) Propositional Logic FV ’19 14 / 64