Introduction

The word logic is derived from ''LOGUS'', which means reason .Logic is the science of formal principles of
reasoning or correct inference. Historically, logic originated with the ancient Greek philosopher
Aristotle. Logic was further developed and systematized by the Stoics and by the medieval scholastic
philosophers. In the late 19th and 20th centuries, logic saw explosive growth, which has continued up to
the present. Logic is thwe science of correct reasoning. Actually,reasoning is any argument in which
certain assumptions or premises are Statements:

The declarative sentence which is either true or false but not both at the same time is called a
statement.

for example:-a)Ram is a doctor.

b)7+4=93-11<5

Types of statements

Statement is of two types.

1 ]Simple statement: The statement which declares one thing at a time is called a simple statement. A
simple statement cannot be divided in two or more than two statements. A simple statement is denoted
by p,q,r,s, etc

Examples-p: Ram is a doctor.

q: 4+3<11

2]Compound statement: when two or more than two simple statements are combined to form a
statement, it is called compound statement. Simple statements are combined to form compound
statement by using words or phrases, called connectives or logical connectives.

The simple statements are called components of the compound statement. Truth value of a compound
statement depends on the truth value of the component statements. Examples:

p)Ram is a doctor and sita is a nurse.

q)3+7<4 or 4+11>20
Mathematical Logic Formulas

Conjunction (AND)

We can join two statements by “AND” operand. It is also known as a conjunction. Its symbolic form is
“∧“. In this operator, if anyone of the statement is false, then the result will be false. If both the
statements are true, then the result will be true. It has two or more inputs but only one output.

2) Disjunction (OR)

We can join two statements by “OR” operand. It is also known as disjunction. It’s symbolic form is “ ∨”.
In this operator, if anyone of the statement is true, then the result is true. If both the statements are
false, then the result will be false. It has two or more inputs but only one output.

3) Negation (NOT)

Negation is an operator which gives the opposite statement of the given statement. It is also known
as NOT, denoted by “∼”. It is an operation that gives the opposite result. If the input is true, then the
output will be false. If the input is false, then the output will be true. It has one input and one output.
The truth table for NOT is given below:

Law of logics

Law of excluded middle

Only one statement p or∼pis true.

A statement cannot both be true and false at the same time.

Law of tautology
The statement p v ∼p is a tautology.The disjunction of a statement and its negation is a tautology.

Law of contradiction

The statement p ∧∼p is a contradiction.

The conjunction of a statement and its negation is a contradiction.

Law of involution∼(∼p)≡p

The negation of negation of a statement is logically equivalent to a given statement. The law is also
known as the law of double negation

e) Law of syllogism

If p⇒ q and q⇒ r then p⇒ r.

That is(p⇒q)∧(q⇒r)⇒(p⇒r)

This can be verified to be a tautology.

Objective

To make able to solve regarding mathematical reasoning and logics.

To develop skills of reasoning .

Conclusions

We would like to thank our subject teacher Mr. Ghanshyam Upadhya sir for giving us this opportunity to
do this project work so that we get knowledge about Mathematical logics and its important in our real
life. We get to learn different thing related to the topic and gained many information about it.