Propositional Logic - Preface
Propositions are statements, statements are propositions, these things are one in the same. Statements are claims which can either be true or false.
I am a dog; this is a proposition
because it could be true or false. I could be a dog, or I could not be a dog.
It is highly unlikely I am a dog, but there is still a possibility that it is
true. However, there are statements which cannot be true or false. Take this
sentence fragment: An orange plus three. Is this an example of a proposition?
No, an orange plus three cannot be valued as true or false.
Propositions are not only limited to sentences used in natural language or un-paraphrased English (or any language really). Propositions can also be mathematical. The following are mathematical statements:
1. $ 7>8 $
2. $ 1+1=2 $
3. $ 89*5+9(4-3) > 34 $
All of these statements are either true
or false. To be precise, propositions (2) and (3) are true and proposition (1)
is false. Let us see some mathematical expressions and miscellanea that are not
propositions:
1. $ 6+3 $
2. $ x > 5 $
The expression in (1) is obviously
neither true nor false, but the inequality in (2) seems like it could be a
proposition. Whenever an equation or an inequality contains a non-assigned
variable, the status of being true or false will be dependent upon further
conditions. This makes such an equation or inequality a non-proposition.
Propositions that cannot be broken
into parts have a further specification; they are known as atomic
propositions.
Atomic propositions have a symbolic
representation or shorthand:
1. p, q, r, s, etc: lower case letters represent generic atomic statements.
2. P, Q, R, S, etc: upper case letters represent specific atomic statements.
The specific atomic statements can be
interpreted as statements in natural language.
In
propositional logic, we can see that atomic statements will be connected by
various symbols which resemble relationships between said statements. For
instance, take the two statements:
1. The
fox is old.
2. Tom
is young.
We can connect the two statements by saying
that the fox is old, and that Tom is young. We can also say that the fox is old
or that Tom is young.
These relationships can be symbolically stated and are known as logical connectives. These can be represented using symbols like $ \land $, $ \lor $, $ \neg $, $ \implies $, and $ \iff $
Atomic statements combined with
connectives are called compound propositions.
It should be noted that logical connectives have precise
semantic rules unlike in natural language. Compound proposition’s truth value
depend solely on the values assigned to the atomic propositions that make it
up. Therefore, the equivocal use of ‘or’ as ‘either or’ in a compound
proposition where either atomic proposition must be true exclusively, as
opposed to ‘or’ being used to mean that at least one of the atomic propositions
is true does not become a problem for logicians. Each connective has a singular
interpretation with no need for context.
Comments
Post a Comment