Logical Connectives

Propositions

Before you go through this article, make sure that you have gone through the previous article on

We have discussed

  • Proposition is a declarative statement that is either true or false but not both.
  • Connectives are used to combine the propositions.

Propositions

In this article, we will discuss about connectives in propositional logic.

Logical Connectives

Connectives are the operators that are used to combine one or more propositions.

In propositional logic, there are 5 basic connectives:
Logical Connectives

Logical Connectives

1. Negation 

If p is a proposition, then negation of p is a proposition which is-

  • True when p is false
  • False when p is true.

Truth TableLogical Connectives

Example

If p : It is raining outside.

Then, Negation of p is-
∼p : It is not raining outside.

2. Conjunction
If p and q are two propositions, then conjunction of p and q is a proposition which is-

  • True when both p and q are true
  • False when both p and q are false

Truth TableLogical Connectives

Example

If p and q are two propositions where:

  • p : 2 + 4 = 6
  • q : It is raining outside.

 Then, conjunction of p and q is:
p ∧ q : 2 + 4 = 6 and it is raining outside

3. Disjunction
If p and q are two propositions, then disjunction of p and q is a proposition which is-

  • True when either one of p or q or both are true
  • False when both p and q are false

Truth TableLogical Connectives

Example

If p and q are two propositions where:

  • p : 2 + 4 = 6
  • q : It is raining outside

Then, disjunction of p and q is:
p ∨ q : 2 + 4 = 6 or it is raining outside

4. Conditional
If p and q are two propositions, then:

  • Proposition of the type "If p then q" is called a conditional or implication proposition.
  • It is true when both p and q are true or when p is false.
  • It is false when p is true and q is false.

Truth TableLogical Connectives

Examples

  • If a = b and b = c then a = c.
  • If I will go to Australia, then I will earn more money.

5. Biconditional

If p and q are two propositions, then-

  • Proposition of the type "p if and only if q" is called a biconditional or bi-implication proposition.
  • It is true when either both p and q are true or both p and q are false.
  • It is false in all other cases.

Truth Table

Logical Connectives

Examples

  • He goes to play a match if and only if it does not rain.
  • Birds fly if and only if sky is clear.

Important Notes

Note 1:

  • Negation ≡ NOT Gate of digital electronics.
  • Conjunction ≡ AND Gate of digital electronics.
  • Disjunction ≡ OR Gate of digital electronics.
  • Biconditional = EX-NOR Gate of digital electronics.

 Note 2:

  •  Each logical connective has some priority.
  • This priority order is important while solving questions.
  • The decreasing order of priority is-

Important Notes

Note 3:

  • Negation, Conjunction, Disjunction and Biconditional are both commutative and associative.
  • Conditional is neither commutative nor associative.
The document Logical Connectives is a part of the Engineering Mathematics Course Engineering Mathematics.
All you need of Engineering Mathematics at this link: Engineering Mathematics

FAQs on Logical Connectives

1. What are the logical connectives used in formal logic?
Ans. The logical connectives used in formal logic are conjunction (and), disjunction (or), negation (not), implication (if...then), and biconditional (if and only if).
2. How are logical connectives used to form compound statements?
Ans. Logical connectives are used to combine simple statements or propositions to form compound statements. For example, the conjunction connective "and" is used to combine two statements and create a new statement that is true only if both of the original statements are true.
3. What is the truth table for the logical connective "or"?
Ans. The truth table for the logical connective "or" is as follows: | P | Q | P or Q | | --- | --- | ------ | | T | T | T | | T | F | T | | F | T | T | | F | F | F |
4. How does the logical connective "not" work in formal logic?
Ans. The logical connective "not" is a unary operator that negates or reverses the truth value of a proposition. It takes a single statement as input and outputs the opposite truth value. For example, if the original statement is true, the negation of that statement will be false.
5. What is the difference between implication and biconditional in formal logic?
Ans. Implication (if...then) and biconditional (if and only if) are both logical connectives used in formal logic, but they have different meanings. Implication states that if the antecedent (the statement that follows "if") is true, then the consequent (the statement that follows "then") must also be true. Biconditional, on the other hand, states that the antecedent and the consequent are equivalent and have the same truth value. In other words, if one is true, the other is also true, and if one is false, the other is also false.
Explore Courses for Engineering Mathematics exam
Get EduRev Notes directly in your Google search
Related Searches
pdf , shortcuts and tricks, mock tests for examination, Objective type Questions, Exam, Previous Year Questions with Solutions, Viva Questions, practice quizzes, MCQs, Semester Notes, Summary, Logical Connectives, Logical Connectives, Sample Paper, past year papers, Free, ppt, Important questions, Logical Connectives, study material, Extra Questions, video lectures;