Chapter 3: Logic Flashcards

1
Q

A _______ is a sentence that is either true or false, but not both simultaneously.

A

Statement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

As long as a sentence is either _____ or ______ that sentence is a statement

A
  • true
  • false
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

TRUE or FALSE: In order for a sentence to be considered a statement, you need to know whether or not it is true or false

A

FALSE: It is still a statement even if you DON’T know whether or not it is true or false.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are three different types of sentences that aren’t statements? Why are they not statements?

A
  • opinions
  • questions
  • commands
  • they aren’t statements because they aren’t true or false
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

_______ is the contradiction or denial of something.

A

Negation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

The negation of a true statement is a _____ statement, while the negation of a false statement is a ______ statement.

A
  • false
  • true
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

In symbolic logic, we use lowercase letters such as ___, ___, ___, and ___ to represent statements

A
  • p
  • q
  • r
  • s
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

The negation of a statement p is written as ____

A

~p

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Can letters such as p, q, or r represent any statement, including
English statements containing the word “not”?

A

Yes. When choosing letters to represent statements, you may prefer to use the symbol ∼ with negated English statements.
However, it is not wrong to let p, q, or r represent such statements.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

_______ _______ are statements containing the word(s) “all,” “some,” and/or “none.”

A

Quantified statement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

The words “all,” “some,” and/or “none” are considered to be ________.

A

Quantifiers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

It seems to me that the negation of “All writers are poets” should be “No writers are poets.” What’s
wrong with my thinking?

A

The negation of “All writers are poets” cannot be “No writers are poets” because both statements are false. The negation of a false statement must be a true statement. In general, the negation of “All A are B” is not “No A are B.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

A statement that conveys one idea without a connection of words is called a ____ _____.

A

simple statement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

______ ______ are statements formed by combining two or more simple statements.

A

compound statements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Words that join simple statements to form a compound statement are called ________.

A

Connectives

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What are five examples of connectives?

A
  1. and
  2. or
  3. if
  4. then
  5. if and only if
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

If p and q represent simple statements, then the compound statement of “p and q” is symbolized by:

A

p ^ q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

The compound statement formed by connecting statements with the word “and” is called a ________. the symbol for the word “and” is:

A
  • conjunction
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

TRUE or FALSE: If the word “and” is in a statement, it is automatically a conjunction

A

FALSE: If the statement cannot be broken down into two simple statements, it is itself a simple statement (e.g. “nonviolence and truth are inseparable.”)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

The connective “or” can mean two different things. What are they?

A
  • exclusive or, which means “one or the other, but not both (ie. I visited London or Paris.)
  • inclusive or, which means “either or both” (ie. I visited London or Paris or both)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

The compound statement formed by connecting with the word “or” is called ______. The symbol for “or” is:

A
  • Disjunction
  • V
22
Q

The compound statement formed by connecting statements with “if-then” is called ______. The symbol for “if -then” is:

A
  • conditional statement
  • —> (arrow)
23
Q

In a conditional statement, the symbol before the —> is called ______ and the symbol after the —> is called ______.

A
  • antecedent
  • consequent
24
Q

The compound statement formed by connecting statements with “if and only if” is called _____. The symbol for “if and only if is:

A
  • biconditional
  • <—>
25
The statement "if and only if" can be abbreviated as ___.
iff
26
Many compound statements contain more than one connective. When expressed symbolically, _________ are used to indicate which simple statements are grouped together. When expressed in English, _________ are used to indicate the groupings. When we translate the symbolic statement into English, the simple statements in parentheses appear on the ______ _______ of the comma.
- parentheses - commas - same side
27
If a symbolic statement appears without parentheses, statements before and after the most _______ _______ should be grouped.
dominant connective
28
When it comes to dominance of connectives, Symbolic connectives are categorized from the most dominant, the __________, to the least dominant, ________.
- biconditional - negation
29
The dominance of connectives used in symbolic logic is defined in the following order:
1. Biconditional 2. conditional 3. Conjunction, ^ Disjunction, V 4. Negation
30
Why is negation considered a connective?
because it does affect the truth value of a statement.
31
When are you supposed to use the dominance of connectives?
Only apply the dominance of connectives if grouping symbols (parentheses) are not given in compound symbolic statements or commas do not appear in compound English statements.
32
A conjunction is only true when:
Both simple statements are true
33
When is a conjunction false?
As soon as you find one simple statement in a conjunction that is false, then the conjunction is false.
34
The statements making up a compound statement are called ________ ___________.
component statements
35
An "or" statement is true in every case, except when both component statements are ______.
false
36
When is a disjunction true?
As soon as you find one component statement in a disjunction that is true, then the disjunction is true.
37
A compound statement that is always true is called a __________.
tautology
38
When is a disjunction false?
When both component statements in the disjunction are false
39
TRUE or FALSE: Every time you hear or utter a conditional statement, you can reverse and negate the antecedent and consequent, and the statement’s truth value will not change.
TRUE
40
Conditional statements that are tautologies are called ________.
implications
41
Some compound statements are false in all possible cases. Such statements are called __________________.
self-contradictions.
42
The only case in which a conditional is false is when:
the first component statement, the antecedent, is true and the second component statement, the consequent, is false.
43
A biconditional is true only when:
the component statements have the same truth value.
44
_________ ____________ ___________ are made up of the same simple statements and have the same corresponding truth values for all true–false combinations of these simple statements.
Equivalent compound statements
45
Which special symbol is used to show that two statements are equivalent?
46
~(~p) ≡ p illustrates that the ________ ________ of a statement is _________ to the statement.
- double negation - equivalent
47
The __________ of a conditional statement is a statement obtained by reversing and negating the antecedent and the consequent.
contrapositive
48
If a compound statement is true, then its equivalent statement:
must also be true
49
If a compound statement is false, then its equivalent statement:
must also be false
50
Truth tables are used to show that two statements are _________.
equivalent.
51
The truth value of a conditional statement does not change if the antecedent and consequent are __________ and both are _________.
- reversed - negated
52