Scribd
Upload
8 views

Predicate Calculus

The document discusses Predicate Calculus in Mathematical Logic, focusing on propositions, their truth values, and the use of connectives to form new propositions. It explains the concepts of universal quantifiers, well-formed formulae (wff), and the hierarchy of operations in logical expressions. Additionally, it defines equivalent formulae based on the truth values of propositions.

Uploaded by

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

Predicate Calculus

The document discusses Predicate Calculus in Mathematical Logic, focusing on propositions, their truth values, and the use of connectives to form new propositions. It explains the concepts of universal quantifiers, well-formed formulae (wff), and the hierarchy of operations in logical expressions. Additionally, it defines equivalent formulae based on the truth values of propositions.

Uploaded by

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

Predicate Calculus

We consider only sentences which are either true or false in Mathematical Logic. Similarly as in
English we can form new sentences from the given sentences in Mathematical logic too.
A proposition or statement is a declarative sentence, that is either true or false but not both.
If the proposition is true , its truth value is T and if it is false , its truth value is F
Egs: (i) The square of 12 is 144.
(ii) 26 is a prime number.
(iii) Discrete Mathematics is a difficult subject.

(iv) Bring one Tea.


(v) No, Thank You.
Connectives
Just as we form new sentences using ‘and , ‘but’ , if etc, we can construct new prepositions from
the given prepositions using connectives. The truth value of the new sentence depends on the
truth value of the sentences from which it is formed and also of the connectives used.
NOT – negation
AND – Conjunction
OR – Disjunction
IF---- THEN – implication
IF AND ONLY IF –
AND OR
P Q 𝑃∧𝑄
0 0 0
0 1 0
1 0 0
1 1 1
P Q 𝑃∨𝑄
0 0 0
0 1 1
1 0 1
1 1 1

IF…THEN IF AND ONLY IF


P Q 𝑃∧𝑄 P Q 𝑃↔𝑄
0 0 0 0 0 1
0 1 0 0 1 0
1 0 0 1 0 0
1 1 1 1 1 1

¬𝑄 → ¬𝑃 contrapositive statement
Universal quantifiers
∀ for all is the universal quantifier
Eg: ∀ 𝑥, 𝑥 2 = (−𝑥 2 ).
∃ − 𝑡ℎ𝑒𝑟𝑒 𝑒𝑥𝑖𝑠𝑡𝑠 𝑖𝑠 𝑎𝑛 𝒆𝒔𝒔𝒆𝒏𝒕𝒊𝒂𝒍 𝒒𝒖𝒂𝒏𝒕𝒊𝒇𝒊𝒆𝒓
Eg: ∃𝑥: 𝑥 2 = 5

Well formed formulae (wff)


A prepositional variable is a symbol representing any preposition.
Eg: Ram is a student
A wff is defined recursively as follows:
(1) If p is a prepositional variable, then it is a wff
(2) If 𝛼 is a wff, then ¬𝛼 is also a wff
(3) If 𝛼 and 𝛽 are wff then 𝛼 ∧ 𝛽, 𝛼 ∨ 𝛽, 𝛼 → 𝛽, 𝛼 ↔ 𝛽 𝑒𝑡𝑐 are wff.
(4) A string of symbols is a wff iff it is obtained by finitely many applications of (1) to (3).

Eg: will be discussed in class


Hierarchy of Operations and parenthesis
Connectives within the parentheses ; among the parentheses innermost first.
Negation
∧ and ∨
→
↔
Equivalent formulae
Two formulas involving the same set of propositional variables are equivalent if the truth values
of the formulas are the same when the same set of truth values are assigned to the propositional
variables.

You might also like