AI PRESENTATION

G R O U P - 2

PROPOSITION
A N D P R E D I C AT E
LOGIC
 GROUP MEMBERS
JAZIB AHMAD

J 01 2019-ag-6460

HIRA NISAR
2019-ag-6459 02
H
RIMSHA RAZZAQ

R 03 2019-ag-6494

S
SAMRA SULTAN
2019-ag-6502 04

KINZA ISHAQ

K 05 2019-ag-6463
 PROPOSITION
A proposition is a term in philosophy and logic. It is a statement which has a truth value, meaning it can be proved to be
true or false. For a proposition to be valid, it must be possible to prove the proposition is either true or false.

PROPOSITIONAL LOGIC
Propositional logic (PL) is the simplest form of logic where all the statements are made by propositions. A proposition is
a declarative statement which is either true or false. It is a technique of knowledge representation in logical and
mathematical form.

Example:

a) It is Sunday.
b) The Sun rises from West (False proposition)
c) 3+3= 7(False proposition)
d) 5 is a prime number.
 FACTS about
PROPOSITIONAL LOGIC
In propositional logic, we use Propositional logic A proposition formula
symbolic variables to represent consists of an object, The propositions and which is always true is A proposition
the logic, and we can use any relations or function, connectives are the called tautology, and formula which has
symbol for a representing a and logical basic elements of the it is also called a valid both true and false
proposition, such A, B, C, P, Q, connectives. propositional logic. sentence. values is called a
R, etc. contingency.

Propositional logic is Propositions can be These connectives are Connectives can be A proposition formula
also called Boolean either true or false, also called logical said as a logical which is always false is
logic as it works on 0 but it cannot be operators. operator which called Contradiction.
and 1. both. connects two
sentences.
CONNECTIVES
OR ( V )
The OR operation of two propositions A and B (written as A V B ) is
true if at least any of the propositional variable A or B is true.

AND ( ꓥ )
The AND operation of two propositions A and B ( written as A ꓥ B) is
true if both the propositional variable And B is true.

NEGATION / NOT  (¬)

The negation of a proposition A ( written as ¬ A ) is false when A is true
and is true when A is false.

IMPLICATION / IF-THEN ( → )
An implication A → B is the proposition “if A, then B”. It is false if A is
true and B is false. The rest cases are true.

IF AND ONLY IF ( ↔ )
A ↔ B is bi-conditional logical connective which is true when p and q
are same i.e. both are false or both are true.
 FORMULAS
Tautologies
A Tautology is a formula
which is always true for
every value of its
propositional variables.
Contingency
A Contingency is a formula
which has both some true
and some false values for
every value of its
propositional variables.

01 02 03

Contradiction
A Contradiction is a formula
which is always false for
every value of its
propositional variables
 PREDICATE LOGIC
A predicate is an expression of one or more variables defined on some specific domain. A predicate with variables can be
made a proposition by either assigning a value to the variable or by quantifying the variable.

The following are some examples of predicates

Let E(x, y) denote "x = y"

Let X(a, b, c) denote "a + b + c = 0"
Let M(x, y) denote "x is married to y"

Well Formed Formula

Well Formed Formula (wff) is a predicate holding any of the following

 All propositional constants and propositional variables are wffs

 If x is a variable and Y is a wff, ∀xY and ∃xY are also wff
 Truth value and false values are wffs
 Each atomic formula is a wff
 All connectives connecting wffs are wffs
 QUANTIFIERS
The variable of predicates is quantified by quantifiers.

Types
1 3
Universal Nested
Universal quantifier states that the If we use a quantifier that appears
statements within its scope are true for within the scope of another quantifier, it
every value of the specific variable. is called nested quantifier.

2
Existential
Existential quantifier states that the
statements within its scope are true for
some values of the specific variable.