2.5 BSED-Filipino 1A

GRAMATICO, ROLAND BSED-FILIPINO 1
LAUREANO, RONALINE V. SEPTEMBER 11, 2O19

VILLAFLOR, SHAIRA 10:30-12:00 WEDNESDAY
VILLARIN, WENALYN V.
GEC.4 MATHEMATICS IN THE MODERN WORLD
LESSON 2.5:ELEMENTARY LOGIC
Logic is technically define as; a science or study of how to evaluate arguments and
reasoning. Logic help as to differentiate correct reasoning from poor reasoning. It is
important in the sense that it help as to reason correctly. Others defined logic as
discipline that deals with the methods of reasoning. And logical reasoning is used on
mathematics to prove theorems. A proposition ( or statement ) is a declarative sentence
which is either true or false, but not both. The true value of propositions is the truth and
falsity of the preposition.
A propositional variables is a variable which is used to represent a propositional. A

form of propositional variable written using propositional logic notation, p,q, and r used
to represent propositions. Logical connectives are used to combine simple propositions
which are referred as compound propositions. A compound proposition is a
proposition composed of two or more simple propositions connected by logical
connectives "and", "or", 'if then", "not" ''if and only if", and "exclusive-or". A proposition
which is not compound is said to be simple (also called atomic).
FOUR TYPES OF ELEMENTARY LOGIC
1.LOGICAL CONNECTIVES- Are words or symbols used to connect two or more

sentences in a logical and grammatically valid way to produce one compound sentence.
Logical connectives are used to combine simple proposition which are referred as
compound proposition.
There are three logical connective such as conjunction, disjunction, and negation.
The following are briefly discussed in this section. Note that T refers to true proposition
and F refers to false proposition.
1.The conjunction of the  proposition- conjunction of proposition p

and q is compound proposition of "p and q''. Symbolically pq where is the symbol '' and''.
If p is true and q is true then pq is true otherwise pq is false. Meaning the conjunction of
true proposition is only true is each proposition is true.
EXAMPLE:
 P is the proposition "today is Friday"
 Q is the proposition "it is raining today".
The conjunction of p and q is proposition of "today is Friday and it is raning today"
2.The disjunction of the proposition- is  the compound proposition "p or q".

Symbolically pq where is the symbol for "or". If p is true or q is true or if both p and
q are true, then pq is true, otherwise pq is false. Meaning te disjunction of two
proposition is false only if each proposition is false.
EXAMPLE:
 Exclusive or
" tonight i will stay home or go out to a movie"
3. Negation of the proposition- p is
If p is true, p is false. Meaning the truth  denoted bp where is the symbol for "not".
value of the negation of a proposition is
always the reverse of the truth value o the original proposition.
EXAMPLE:
" today is Friday"
"it is not case the today is Friday" or
''today is not Friday''.
2.LOGICAL QUANTIFIERS- quantifiers are expressions or phrases that indicate the

number of objects that a statement pertains to.
Two types of Quantifiers

1.Existentials Quantifier
If existentially quantified statement accurately describes at least one object in the
collection, then it is true.
Phrase: There exist
Symbol: 
2.Universal Quantifier
If every object in the collection fits the description, then the universally qualified
statement is true.
Phrase: for all
Symbol: 
3.LOGICAL NEGATION-Negation is
may applied as an operational on nation,
 thus a unary ( single-argument) logical.it
proposition, truth values, or semantic
values more generally in classical logic, negation is normally identified with the truth
function that takes truth to falsity and vice versa. In logic, negation, also called the logical
complement, is an operation that takes a proposition P to another proposition "not p"
written p, which is interpreted intuitively as being true when P false, and false when P is
true. In intuitionistic logic, according to the Brouwer-Heyting-Kolmogorov interpretation,
the negation of proposition P is the proposition whose proofs are the refufation of P.
4.LOGICAL VARIABLES- In logic , a variable is a symbol used to refer to something

else. On the other hand propositional variable represent entire sentences.
PROPOSITIONAL EQUIVALENCES
 A compound proposition that is always true is called a tautology.
 A compound proposition that is always false is called a contradiction.
 A compound proposition that is neither a tautology nor a contradiction is called a
contingency.
PROPOSITIONAL CHART
q q p and q
T T T
T F F
F T F
F F F
The chart lists the four possible truth values of the two sentences p and q :
Both are true;
p is true, but q is false
p is false, but q is true
Both are false
- - - - -- - - --- - - - - - - -- - - - - - - -- -- - -- - - - - - - - - - - -- - - --- - - - - - - -- - - - - - - -

2.5 BSED-Filipino 1A

Uploaded by

Copyright:

Available Formats

2.5 BSED-Filipino 1A

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

2.5 BSED-Filipino 1A

Uploaded by

Copyright:

Available Formats

GRAMATICO, ROLAND BSED-FILIPINO 1

LAUREANO, RONALINE V. SEPTEMBER 11, 2O19

A propositional variables is a variable which is used to represent a propositional. A

FOUR TYPES OF ELEMENTARY LOGIC

1.LOGICAL CONNECTIVES- Are words or symbols used to connect two or more

1.The conjunction of the  proposition- conjunction of proposition p

2.The disjunction of the proposition- is  the compound proposition "p or q".

2.LOGICAL QUANTIFIERS- quantifiers are expressions or phrases that indicate the

Two types of Quantifiers

4.LOGICAL VARIABLES- In logic , a variable is a symbol used to refer to something

You might also like