Scribd
Upload
387 views

Logic Chapter 1 - Decision Procedure

This document provides an overview of the shorter truth table method for determining if a statement is a tautology or not. It defines key logical terms like tautology, contradiction, and contingency. The shorter truth table method assumes a statement is not a tautology and tests for inconsistencies. If an inconsistency is found, the assumption is wrong and the statement is a tautology. If no inconsistency is found, the statement is either a contradiction or contingency but not a tautology.

Uploaded by

Mithibai Faces
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
387 views

Logic Chapter 1 - Decision Procedure

This document provides an overview of the shorter truth table method for determining if a statement is a tautology or not. It defines key logical terms like tautology, contradiction, and contingency. The shorter truth table method assumes a statement is not a tautology and tests for inconsistencies. If an inconsistency is found, the assumption is wrong and the statement is a tautology. If no inconsistency is found, the statement is either a contradiction or contingency but not a tautology.

Uploaded by

Mithibai Faces
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/ 5

J.

S Tutorials
Subject: Logic
Topic: Decision Procedure
Chapter: 1
Class: 12th

* I.M. Copi defines logic as “The study of the methods and principles used to distinguish good
(correct) from bad (incorrect) reasoning.”
* Shorter truth table method is a decision procedure. It is based on ‘Indirect method’.
* Shorter Truth Table method is based on the principle of reductio-ad-absurdum.
* We need shorter and accurate method for determining whether a statement form is Tautology or not.
Hence shorter truth table method is introduced. It can be carried out in a single line.

There are 5 elements which are composed under the ‘Basic Truth Table’
1. Conjunction- p . q
2. Disjunction- p v q
3. Implication- p ↄ q
4. Equivalence- p ≡ q
5. Negation- ~P

Application of the above elements under the ‘Basic Truth Table’:


1. Conjunction- p . q
T T T Denotes: T T T (All the elements are ‘True’)
T F F
F F T
F F F

2. Disjunction- p v q
T T T
T T F
F T T
F F F Denotes: F F F (All the elements are ‘False’)
3. Implication- p ↄ q
T T T
T F F Denotes: T F F
F T T (If p is True and q is False,
F T F then its Implication will be ‘False’)

4. Equivalence: p ≡ q
T T T Denotes: T T T (If both, p and q are ‘True’,
F F T Equivalence is also ‘True’)
F F T
F T F Denotes: F T F (If both, p and q are ‘False’,
then also its Equiv. is ‘True’)

5. Negation: ~p
F T
T F
Denotes: If antecedent (1st term) is False, then its
consequent (2nd term) will be True and vice-versa.

* In the Shorter Truth Table method, the left term (‘p’) is known as the ‘Antecedent’, whereas the
right variable (‘q’) is known as the ‘Consequent’.
* It is used to test whether a statement form is a Tautology or Not a Tautology.
* While constructing shorter truth table, we assume that the statement form is not a tautology by
placing the truth value ‘F’ under the main connective of the statement form.
* If we arrive at an inconsistency, then the assumption is wrong and given statement form is a
tautology (tautologous).
* If we do not arrive at any inconsistency, then the assumption is correct and hence the given
statement form is not a tautology. It is either contradictory or contingency.
* This method is reliable, finite and mechanical
* Negation (~p) is considered as a ‘Monadic connective’. This is because it consists of only one
variable.
* Conjunction, Disjunction, Implication and Equivalence are considered as ‘Dyadic’ or ‘Binary’
connectives. This is because it consists of two variables (p and q) and joins both of them together.
* Tautology is a statement form which is always ‘True’ under all truth possibilities of its components.
* Contradiction is a statement form which is always ‘False’ under all possibilities.
* Contingency is statement form which is ‘True’ under some possibilities and ‘False’ under some
possibilities.
* A statement having antecedent (p) and consequent (q) as its components is known as a
‘Conditional statement’.

Exercise Solutions: (Pg. 8)

Q. 1. Fill in the blanks with suitable words from those given in the brackets:
(1) Shorter truth table is an indirect method. (direct/indirect)
(2) Shorter Truth Table method is based on the principle of reductio-ad-absurdum.
(Truth table/ Shorter Truth Table)
(3) If both the antecedent and the consequent of an implicative statement are false then the statement
is true. (true/false)
(4) If inconsistency is obtained after assuming the given statement form to be false, then the statement
form is proved to be tautology. (tautology/ not a tautology)
(5) When both the components of a disjunctive statement are false then the truth value of the
statement is false. (true/ false)
(6) When we deny tautology, we get contradiction. (contradiction/ contingency)

(7) If ‘p’ is true then ‘p’ is false. (true/ false)


(8) Shorter truth table is a decision procedure. (decision procedure/ deductive proof)
(9) Equivalence is true when both its components are false. (true/ false)

(10) ~ is a symbol used for negative statement? (• / )

Q. 2. State whether the following statements are true or false.


(1) A negative statement is false when its component statement is true.

- True

(2) If a conjunctive proposition is false both its components must be false.

- True

(3) ‘•’ is a monadic connective.

- False
(4) Inconsistency in a shorter truth table is obtained when a rule of basic truth table is violated.

- True

(5) Shorter truth table method is inconvenient than truth table method.

- False

(6) Truth table is based on the principle of reductio-ad-absurdum.

- False

(7) Shorter truth table does not directly prove whether a statement form is a tautology or not.

- True

(8) Contingency is always true.

- False

(9) If the consequent is true then the implicative statement must be true.

- False

(10) Contradictory statement form is always false.

- True

(11) ‘ p   p’ is a tautology.

- False

Q. 3. Match the columns :

(A) (B)
(1) Shorter Truth Table (a) Always true
(2) Truth Table (b) Always false
(3) Contradiction (c) Direct Method
(4) Tautology (d) Reductio-ad- absurdum
Ans: 1- d, 2- c, 3- b, 4- a

Q. 4. Give logical terms for the following:


(1) A statement form which is always true.
- Tautology
(2) A decision procedure based on reductioad-absurdum.
- Shorter Truth Table method
(3) A statement form which is true under all truth possibilities of its components.
- Tautology
(4) A decision procedure which is an indirect method.
- Shorter Truth Table
(5) Statement having antecedent and consequent as its components.
- Conditional statement
(6) A statement form which is false under all possibilities.
- Contradiction
(7) A statement form which is true under some possibilities and false under some possibilities
- Contingency

..............................................................................................................................................................................

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