Scribd
Upload
18 views10 pages

There Exists An Integer That Is Not The Sum of Two Squares Importance of Mathematical Logic

The document discusses the importance of logic in mathematical reasoning and its applications in computer science. It covers propositional logic, types of propositions, and various logical connectives such as negation, conjunction, disjunction, exclusive or, implication, and biconditional. The text also emphasizes the role of truth tables in evaluating the truth values of propositions.

Uploaded by

harmeetkhatri22
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
18 views10 pages

There Exists An Integer That Is Not The Sum of Two Squares Importance of Mathematical Logic

The document discusses the importance of logic in mathematical reasoning and its applications in computer science. It covers propositional logic, types of propositions, and various logical connectives such as negation, conjunction, disjunction, exclusive or, implication, and biconditional. The text also emphasizes the role of truth tables in evaluating the truth values of propositions.

Uploaded by

harmeetkhatri22
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 10

Logic is the basis of all mathematical reasoning and all

automated reasoning. The rules of logic specify the


meaning of mathematical statements. These rules help
us understand and reason with statements such as –
∃ x such that x ≠ a2 + b2, where x, a, b∈ Z∃ x such
that x = a2 + b2, where x, a, b∈ Z
Which in Simple English means “There exists an
integer that is not the sum of two squares“.
Importance of Mathematical Logic
The rules of logic give precise meaning to mathematical
statements. These rules are used to distinguish between
valid and invalid mathematical arguments. Apart from
its importance in understanding mathematical
reasoning, logic has numerous applications in
Computer Science, varying from the design of digital
circuits to the construction of computer programs and
verification of the correctness of programs.
Aiming for a top All India Rank in GATE CS/IT or
GATE DA 2026? Our courses, led by experts
like Khaleel Sir, Chandan Jha Sir, and Vijay Agarwal
Sir, offer live classes, practice problems, doubt
support, quizzes, and All India Mock Tests—all in one
place.
Table of Content
 Types of Propositions
 Propositional Logic
 Truth Table of Propositional Logic
 Propositional Logic Examples

Types of Propositions
In propositional logic, propositions are statements that
can be evaluated as true or false. They are the building
blocks of more complex logical statements. Here’s a
breakdown of the two main types of propositions:
 Atomic Propositions
 Compound Propositions
Propositional Logic
Propositional logic is a branch of mathematics that
studies the logical relationships between propositions
(or statements, sentences, assertions) taken as a whole,
and connected via logical connectives.
For Example,
1. The sun rises in the East and sets in the West.
2. 1 + 1 = 2
3. ‘b’ is a vowel.
Above 3 sentences are propositions, where the first two
are Valid(True) and the third one is Invalid(False).
All of the above sentences are propositions, where the
first two are Valid(True) and the third one is
Invalid(False). Some sentences that do not have a truth
value or may have more than one truth value are not
propositions. For Example,
1. What time is it?
2. Go out and Play
3. x + 1 = 2
The above sentences are not propositions as the first
two do not have a truth value, and the third one may be
true or false. To represent propositions, propositional
variables are used. By Convention, these variables are
represented by small alphabets such as p,q,r,s p,q,r,s .
The area of logic which deals with propositions is
called propositional calculus or propositional logic. It
also includes producing new propositions using existing
ones. Propositions constructed using one or more
propositions are called compound propositions. The
propositions are combined together using Logical
Connectives or Logical Operators.
Propositional Logic
Truth Table of Propositional Logic
Since we need to know the truth value of a proposition
in all possible scenarios, we consider all the possible
combinations of the propositions which are joined
together by Logical Connectives to form the given
compound proposition. This compilation of all possible
scenarios in a tabular format is called a truth table.
Most Common Logical Connectives-
1. Negation
If p p is a proposition, then the negation of p p is
denoted by ¬p ¬p , which when translated to simple
English means- “It is not the case that p” or simply
“not p“. The truth value of -p is the opposite of the
truth value of p. The truth table of -p is:

p ¬p

T F

F T

Example, Negation of “It is raining today”, is “It is


not the case that is raining today” or simply “It is not
raining today”.
2. Conjunction

conjunction is denoted by p∧q p∧q , which means


For any two propositions p p and q q , their

“p p and q q “. The conjunction p∧q p∧q is

False. The truth table of p∧q p∧q is:


True when both p p and q q are True, otherwise

p∧
p q q

T T T

T F F
p∧
p q q

F T F

F F F

Example, Conjunction of the propositions p p –

today”, p∧q p∧q is “Today is Friday and it is


“Today is Friday” and q q – “It is raining

raining today”. This proposition is true only on rainy


Fridays and is false on any other rainy day or on
Fridays when it does not rain.
3. Disjunction

disjunction is denoted by p∨q p∨q , which means


For any two propositions p p and q q , their

“p p or q q “. The disjunction p∨q p∨q is True

The truth table of p∨q p∨q is:


when either p p or q q is True, otherwise False.

p∨
p q q

T T T

T F T

F T T
p∨
p q q

F F F

Example, Disjunction of the propositions p p –

today”, p∨q p∨q is “Today is Friday or it is raining


“Today is Friday” and q q – “It is raining

today”. This proposition is true on any day that is a


Friday or a rainy day(including rainy Fridays) and is
false on any day other than Friday when it also does
not rain.
4. Exclusive Or

exclusive or is denoted by p⊕q p⊕q , which means


For any two propositions p p and q q , their

or p⊕q p⊕q is True when either p p or q q is


“either p p or q q but not both”. The exclusive

The truth table of p⊕q p⊕q is:


True, and False when both are true or both are false.

p q p⊕q

T T F

T F T

F T T

F F F
p q p⊕q

Example, Exclusive or of the propositions p p –

today”, p⊕q p⊕q is “Either today is Friday or it is


“Today is Friday” and q q – “It is raining

raining today, but not both”. This proposition is true on


any day that is a Friday or a rainy day(not including
rainy Fridays) and is false on any day other than
Friday when it does not rain or rainy Fridays.
5. Implication
For any two propositions p p and q q , the
statement “if p p then q q ” is called an
implication and it is denoted by p→q p→q . In the
implication p→q p→q , p p is called
the hypothesis or antecedent or premise and q q is
called the conclusion or consequence. The implication
is p→q p→q is also called a conditional statement.
The implication is false when p p is true and q q is
false otherwise it is true. The truth table
of p→q p→q is:

p→
p q q

T T T

T F F
p→
p q q

F T T

F F T

One might wonder that why is p→q p→q true


when p p is false. This is because the implication
guarantees that when p p and q q are true then the
implication is true. But the implication does not
guarantee anything when the premise p p is false.
There is no way of knowing whether or not the
implication is false since p p did not happen. This
situation is similar to the “Innocent until proven
Guilty” stance, which means that the
implication p→q p→q is considered true until
proven false. Since we cannot call the
implication p→q p→q false when p p is false, our
only alternative is to call it true.
This follows from the Explosion Principle which says:
“A False statement implies anything” Conditional
statements play a very important role in mathematical
reasoning, thus a variety of terminology is used to
express p→q p→q , some of which are listed below.
“If p, then “q”p is sufficient for q””q when p””a
necessary condition for p is q””p only if q””q unless
≠p””q follows from p”
Example, “If it is Friday then it is raining today” is a
proposition which is of the form p→q p→q . The
above proposition is true if it is not Friday(premise is
false) or if it is Friday and it is raining, and it is false
when it is Friday but it is not raining.
6. Biconditional or Double Implication
For any two propositions p p and q q , the
statement “p p if and only if(iff) q q ” is called a
biconditional and it is denoted by p↔q p↔q . The
statement p↔q p↔q is also called a bi-

as (p→q)∧(q→p) (p→q)∧(q→p) The implication is


implication. p↔q p↔q has the same truth value

true when p p and q q have same truth values, and


is false otherwise. The truth table of p↔q p↔q is:

p↔
p q q

T T T

T F F

F T F

F F T

Some other common ways of


expressing p↔q p↔q are:
“p is necessary and sufficient for q””if p then q, and
conversely””p if q”
Example, “It is raining today if and only if it is Friday
today.” is a proposition which is of the
form p↔q p↔q . The above proposition is true if it is
not Friday and it is not raining or if it is Friday and it
is raining, and it is false when it is not Friday or it is
not raining.

You might also like