Scribd
Upload
23 views

History of Logic Proof

Greek philosopher Aristotle was a pioneer of logic proof. The rules of logic specify the precise meanings of mathematical statements and are the basis of correct mathematical arguments (proofs). Propositions in logic must be either true or false, such as "John loves CSE 191" or "Sun rises from the West." Logical operators like negation, conjunction, disjunction, implication, and bidirectional implication are used to relate propositions through truth tables.

Uploaded by

amir s
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
23 views

History of Logic Proof

Greek philosopher Aristotle was a pioneer of logic proof. The rules of logic specify the precise meanings of mathematical statements and are the basis of correct mathematical arguments (proofs). Propositions in logic must be either true or false, such as "John loves CSE 191" or "Sun rises from the West." Logical operators like negation, conjunction, disjunction, implication, and bidirectional implication are used to relate propositions through truth tables.

Uploaded by

amir s
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/ 8

History of logic proof:

The word logic is comes from the Latian word,”probare”


meaning “to test”.
In modern English the word “Probabilty” is used.
Greek Philosopher Aristotle was the pioneer of logic proof.
The Foundations: Logic and Proof
The rules of logic specify the precise meanings of mathematical
statements.
It is the basis of the correct mathematical arguments, that is, the
proofs.
It also has important applications in computer science:
to verify that computer programs produce the correct output for all
possible input values.
To show algorithms always produce the correct results.
To establish the security of systems.
Propositional Logic
Definition
A proposition is a declarative statement.
It must be either TRUE or FALSE.
It cannot be both TRUE and FALSE.
We use T to denote TRUE and F to denote FALSE
Example of propositions:
Example of propositions:
John loves CSE 191.
2+3=5.
2+3=8.
Sun rises from West.
Example of non-propositions:
Solve the equation 2 + x = 3.
Negation operator
Definition:
Suppose p is a proposition.
The negation of p is ¬p.
Meaning of ¬p: p is false.

Example: Truth table for negation:


p ¬p
T F
F T
Conjunction
Now we introduce a binary operator: conjunction ∧, which
corresponds
to and:
p ∧ q is true if and only if p and q are both true.

Truth table for conjunction:


P q p∧q
T T T
T F F
F T F
F F F
Disjunction
Another binary operator is disjunction ∨, which
corresponds to or, (but
is slightly different from common use.)
p ∨ q is true if and only if p or q (or both of them) are
true

Truth table for disjunction:


P qp∨q
T T T
T F T
F T T
F F F
Implication
Yet another binary operator implication
→: p → q corresponds to p
implies q.

Truth table for implication:


P qp→q
T T T
T F F
F T T
F F T
Bidirectional implication
Another binary operator bidirectional implication ↔: p
↔q
corresponds to p is T if and only if q is T.
Truth table for bidirectional
implication:
P qp↔q
T T T
T F F
F T F
F F T

You might also like