Scribd
Upload
11 views10 pages

mathematics

The document provides an overview of mathematical logic, emphasizing its significance in computer science, mathematics, philosophy, and artificial intelligence. It explains propositional logic, including definitions, logical connectives, and truth tables, while also detailing important concepts like tautology and De Morgan's laws. Examples are included to illustrate the application of these concepts in logical reasoning.

Uploaded by

Rivu shit
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
11 views10 pages

mathematics

The document provides an overview of mathematical logic, emphasizing its significance in computer science, mathematics, philosophy, and artificial intelligence. It explains propositional logic, including definitions, logical connectives, and truth tables, while also detailing important concepts like tautology and De Morgan's laws. Examples are included to illustrate the application of these concepts in logical reasoning.

Uploaded by

Rivu shit
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/ 10

TITLE

LOREM
IPSUM
Sit Dolor Amet
INTRODUCTION

• Mathematical logic is a branch of mathematics that focuses with formal systems and the
study of statements, proofs and their relationships.
• It involves symbolic reasoning using symbols to represent logical statements and derive
conclusions.
• Mathematical logic is the study of formal systems, reasoning processes, and the structures
that define truth in mathematical theory.
IMPORTANCE OF MATHEMATICAL LOGIC

• Applications in Computer Science:


Logic forms the foundation for algorithms, programming languages, and artificial intelligence.
• Mathematical Proofs:
Logic is critical in constructing rigorous proofs and establishing truth in mathematics.
• Philosophy & Linguistics:
Logic helps clarify reasoning, truth, and the structure of language.
• Artificial Intelligence:
Logic is used for reasoning in AI systems, decision-making, and algorithms.
PROPOSITIONAL LOGIC
• Definition: Deals with propositions and logical connectives.
• Propositions:
A declarative statement that is either true or false.
Example: "2 + 2 = 4" is true, "5 is greater than 10" is false.
• Logical Connectives:
Symbols used to combine or modify propositions.
• Basic Operators:
•CONJUNCTION ( ∧ ): Both propositions must be true for the result to be true.
•DISJUNCTION ( ∨ ): At least one of the propositions must be true.
•NEGATION ( ¬ or ~ ): Negates the truth value of a proposition.
•CONDITIONAL ( → ): "If P, then Q" – True except when P is true and Q is false.
•BICONDITIONAL ( ↔ ): "P if and only if Q" – True when both P and Q share the same truth
or false value.
1. P → Q = ~P ∨ Q

2. P ↔ Q = (P → Q) ∧(Q → P)
TRUTH TABLES
Truth tables are used to show all possible truth values for logical expressions.
 Example for Conjunction ( ∧ ):
P Q P∧Q
F F F
F T F
T F F
T T T
Both propositions must be true for the result to be true.
 Example for Disjunction ( ∨ ):
P Q P∨Q
F F F
F T T
T F T
T T T
At least one of the propositions must be true.
TRUTH TABLES
 Example for Conditional or Implication ( → ):

P Q P→Q
F F T
F T T
T F F
T T T
"If P, then Q" – True except when P is true and Q is false.

 Example for Biconditional ( ↔ ):

P Q P∨Q
F F F
F T T
T F T
T T T
"P if and only if Q" – True when both P and Q share the same truth or false value.
TRUTH TABLES
 Example for Negation (¬ or ~ ):
P ~P
F T
T F
Negates the truth value of a proposition.

SOME IMPORTANT DEFINITIONS & FORMULAS


 Define Converse, Inverse, and Contrapositive of an Implication.
 Converse:- The converse of P → Q is Q → P.
 Inverse:- The inverse of P → Q is ~P → ~Q.
 Contrapositive:- The contrapositive of P → Q is ~Q → ~P.
 Define Tautology.
 For all combinations of the variables if a propogational statement gives true value then this statement is known as
tautology.
 De Morgan’s law:-
• ~(P ∧ Q)≡~P ∨ ~Q ~(P ∨ Q)≡~P ∧ ~Q
 Distributive law:-
• P ∧(Q ∨ R)≡(P ∧ Q) ∨ (P ∧ R) P ∨(Q ∧ R)≡(P ∨ Q) ∧ (P ∨ R)
1. P → Q = ~P ∨ Q
2. P ↔ Q = (P → Q) ∧(Q → P)
EXAMPLE

 Find the converse, inverse and contrapositive of the following statement.


If the day is sunny then I go to the school.
 P: The day is sunny.
Q: I go to the school.
converse:- If I go to the school then the day is sunny.
inverse:- If the day is not sunny then I not go to the school.
contrapositive:- If I not go to the school then the day is not sunny.
EXAMPLE

 Prove that tautology: ~(P ∨ Q) ∨(~P ∧ Q) ∨ P

P Q (P ∨ Q) ~(P ∨ Q) ~P ~P ∧ Q ~(P ∨ Q) ∨(~P ∧ ~(P ∨ Q) ∨(~P ∧ Q) ∨


Q) P
F F F T T F T T
F T T F T T T T
T F T F F F F T
T T T F F F F T

You might also like