Scribd
Upload
56 views5 pages

Compound Statements and Grouping Rules

1. Compound statements may contain more than two simple statements and require grouping symbols to avoid confusion. Parentheses are used in symbolic form and commas are used in sentence form to indicate which simple statements are grouped together. 2. Quantifiers like "some" and "all" are used to assert properties for subsets of sets. Existential quantifiers assert the existence of something while universal quantifiers assert properties for all elements of a set. 3. To negate statements with quantifiers, the negation must make the original statement false. For example, the negation of "Some coffee shops are open" is "No coffee shops are open".

Uploaded by

22-02923
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
56 views5 pages

Compound Statements and Grouping Rules

1. Compound statements may contain more than two simple statements and require grouping symbols to avoid confusion. Parentheses are used in symbolic form and commas are used in sentence form to indicate which simple statements are grouped together. 2. Quantifiers like "some" and "all" are used to assert properties for subsets of sets. Existential quantifiers assert the existence of something while universal quantifiers assert properties for all elements of a set. 3. To negate statements with quantifiers, the negation must make the original statement false. For example, the negation of "Some coffee shops are open" is "No coffee shops are open".

Uploaded by

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

Module 5-1 B

Compound Statements and Grouping Symbols

Compound statements may contain more than two simple statements. To avoid
confusion with the meaning of the statements, groupings of statements are necessary.
Here are the rules in groupings:

Rules of Grouping of a Compound Statement


1. In symbolic form, the parentheses are used to indicate the simple statements that are
being grouped together.
2. In sentence form, a comma is used to indicate which simple statements are group
together. That is, statements of the same side a comma are group together.
The meaning of the statement is affected by the parenthesis of the symbolic statements.
For example, the compound statement ∼ (p∧q) is different from p ∧ q. The former is the
negation of the compound statement p ∧ q. The statement ∼ (p ∧ q) is read as “ It is not
true that, p ∧ q”. In the latter, the negation is on the statement p only and read as “ Not p
and q”.

Remarks. In translating compound statement in symbolic form to an English


sentence, the simple statements inside the parentheses in the symbolic form will all be
on the same side of the comma that appears in the English sentence.
Example 5.5.
Let p, q, andr represent the following statements.
p : John’s playing style is the same as Lebron’s.
q : Hazel has straight hair.
r : John is a basketball player.
a. Write the symbolic form as an English sentence.

(p ∧ q) → r

b. Write in symbolic form the given statement below.


If John is not a basketball player or Hazel has a straight hair, then John’s playing
style is not the same as Lebron’s.
Solution.
a. Since p and q are grouped together, they must be on the same side of the comma in
English sentences. Hence, this becomes, ‘
If John’s playing style is the same as Lebron’s and Hazel has straight hair, then
John is a basketball player.
b. The statements “John is not a basketball player” and “ John’s playing style is not the
same as Lebron’s” are the negation of the statements r and p, respectively. The
sentence is a conditional form and the first two statements are of the same side of the
comma. Hence, the symbolic form is
( r ∨ q) → p.

Quantifiers and their Negation


In English sentences, some are true for all or it is true for some conditions. In
order that these kinds of sentences are to be statements, quantifiers are needed.
Definition 5.4 (Existential and Universal Quantifiers).
• Existential Quantifiers. These are used as prefixes to assert the existence of
something. These include the word some, and the phrases there exists and at least
one.
• Universal Quantifiers. These are used as prefixes to assert that every element
of a given set satisfies some conditions or to deny the existence of something. These
include the words all, every, none, and no.
Example 5.6.
The first two statements used existential quantifiers and last two statements used
universal quantifiers.
1. Some coffee shops are open.
2. There exists an integer n such that 3n ≥ 120.
3. All players are nice people.
4. No even integers are divisible by 3.
Negation of statements involving quantifiers
In the previous discussion, it is known that the negation of a statement is false if
the statement is true and it is true if the statement is false. This concept must be
considered in constructing the negation of a statement involving quantifiers.
For example, let us consider the statement “Some coffee shops are open”.
Suppose this statement is true, this means that some coffee shops are open, and others
are not open. To find its negation, we need to write a statement that is false if that given
statement is true and false if otherwise. Observe that the statement “Some coffee shops
are not open” has the same meaning as the first statement. Hence, this statement
cannot be the negation of the given statement. Thus, the statement “No coffee shops
are open” will make the given statement false. Hence, it is the negation of the given
statement.
The table below shows the negation of the quantified statements and their
negation.
Practice Sheet
1. Write each symbolic statement as an English sentence. Use p, q, r, s, and t as
defined below.

p : Sarah Geronimo is a singer.


q : Sarah Geronimo not a songwriter.
r : Sarah Geronimo is an actress.
s : Sarah Geronimo plays the piano.
t : Sarah Geronimo does not play the guitar.
(a) (p ∧ q) ∨ r
(b) ∼ p → (p ∨ r)
(c) (p ∨ s) → (q ∧ t)
(d) (r ∧ p) ↔ q
(e) t ↔ (∼ r∧∼ p)

2. Write each sentence in symbolic form. Use p, q, rand s as defined below.


p : Paul is a table tennis player.
q : Paul is a basketball player.
r : Paul is a rock star.
s : Paul is a mechanical engineer.

(a) Paul is a table tennis player or a basketball player, and he is not an engineer.
(b) If it is not true that Paul is a table tennis player or a rock star, then Paul is a
mechanical engineer.
(c) Either Paul is a basketball player and a rock star, or he is a table tennis
player.
(d) Paul is a basketball player, if and only if he is not a football player and he is
not a rock star.
(e) If Paul is a mechanical engineer, then he is a basketball player and he is not
a table tennis player.
3. Write the negation of each quantified statement. Start each negation with “some,”
“no,” or “All.” [ Source: Mathematical Excursions by Hoffmann, et al.]
(a) Some lions are playful.
(b) All classic movies were first produced in black and white.
(c) No even numbers are odd numbers.

Common questions

Powered by AI

Quantifiers like 'existential' (e.g., 'some', 'there exists') indicate that at least one element satisfies a condition, while 'universal' quantifiers (e.g., 'all', 'every', 'none') assert that every element satisfies a condition. They are critical in forming accurate statements and their negations, as illustrated by the example 'Some coffee shops are open,' whose negation is 'No coffee shops are open,' not 'Some coffee shops are not open' .

The document negates the statement "All classic movies were first produced in black and white" by stating that "Some classic movies were not first produced in black and white." This ensures that the negation is true only if the original statement is false, thus adhering to logical principles of negating universal quantifiers .

The sentence translates to (p ∨ q) ∧ ∼s. Here, 'Paul is a table tennis player or a basketball player' corresponds to p ∨ q, while 'and he is not an engineer' adds the negation of being an engineer, ∼s. The conjunction 'and' groups these into a compound statement using the logical AND operator .

The document explains that in translating (p ∧ q) → r, since p and q are grouped together, they must appear together on the same side of the comma in the English sentence. The sentence becomes: 'If John’s playing style is the same as Lebron’s and Hazel has straight hair, then John is a basketball player' .

Using the same statement as its own negation is incorrect because the negation must make the original statement false if it were true. For example, for 'Some coffee shops are open,' the statement 'Some coffee shops are not open' is not a proper negation since both can be simultaneously true. The correct negation is 'No coffee shops are open' because if the original is true, the negation must be false and vice versa .

The document advises translating English sentences with conjunctions like 'or' into symbolic forms by considering the logical relationships between statements. Statements like 'If John is not a basketball player or Hazel has straight hair, then John's playing style is not the same as Lebron's' translate to (∼r ∨ q) → ∼p, where parentheses group logical operations to preserve the intended relationships .

The principles guiding the grouping of statements in symbolic logic involve using parentheses to indicate which simple statements are grouped together, affecting the meaning of the compound statement. For example, the document notes that ∼(p ∧ q) differs from p ∧ q due to the impact of parentheses, signifying grouping for logical interpretation .

The document converts the statement into symbolic form as s → (q ∧ ∼p). The condition 'If Paul is a mechanical engineer' translates to s, while 'he is a basketball player and he is not a table tennis player' converts to q ∧ ∼p, with parentheses indicating the grouping necessary for accurately conveying the compound outcome .

The symbolic form ∼(p ∧ q) means 'it is not true that both p and q are true,' implying that at least one of these statements is false. This contrasts with p ∧ ∼q, which means 'p is true and q is not true,' specifying that p must be true while q must be false .

The document illustrates negation by transforming 'Some lions are playful' into 'No lions are playful,' which acts as the correct negation. It emphasizes that negations involving existential quantifiers should assert the non-existence of the stated condition if the original was possible, thus ensuring logical accuracy .

You might also like