Exam 2 Flashcards

(28 cards)

1
Q

Antecedent

A

The proposition to the left of the horseshoe is the antecedent

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

Argument Form

A

An arrangement of logical operators and statements and statement variables in which a consistent replacement of the statement variables by statements results in an argument.

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

Biconditional

A

A biconditional is only true when the component propositions share a truth value (both true or both false). Otherwise it is false.

Symbolized by the tribal =. This is generally used to capture the phrase “if and only if”.

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

Compound Statement

A

A statement that has at least one simple statement as a component. E.g. “It is hot and humid today.”

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

Conditional

A

A conditional is only false when the antecedent is true and the consequent is false. Otherwise, it is true.

Our fourth symbol is the hook or horseshoe ⊃ which is used to translate conditionals. The exception is the phrase “only if” which signals the consequent.

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

Conjuct

A

Each of the statements in a conjunction is called a conjunct. Many English words are symbolized using the dot ● including: and, while, but, yet, moreover, also, still, although, etc.

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

Conjunctions

A

A conjunction is only true when both conjuncts are true. Otherwise, it is false.

Our second symbol is the dot ● which is used to symbolize conjunctions

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

Consequent

A

The proposition to the right of the horseshoe is the consequent

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

Consistent Statements

A

Two or more statements that have at least one line on their respective truth tables where the main operators are true. Two or more statements that can both be true at the same time.

R ⋁ B and R ⋁ ~B are consistent

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

Contingent Statements

A

A statement that is sometimes true and sometimes false

E.g. A ⦁ B

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

Contradictory Statements

A

Two statements that have opposite truth values on every line of their respective truth tables

E.g. ~F ⋁ S and F ⦁ ~S are contradictory statements

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

Disjunct

A

Each of the propositions in a disjunction is called a disjunct.

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

Disjunction

A

A disjunction is only false when both disjuncts are false. Otherwise, it is true.

The third logical operator is the wedge ⋁ which is used to symbolize disjunctions. We use this to translate words and phrases like “or”, “unless”, and the phrase “either… or…”

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

Exclusive Disjunction

A

Both disjuncts cannot be true at the same time. “You will pass or fail this course.”

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

Inclusive Disjunction

A

Both disjuncts can be true at the same time. “Premiums will be waived in the event of injury or unemployment.”

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

Inconsistent Statements

A

Two or more statements that do not have even one line on their respective truth tables where the main operators are true (but they can be false). Two or more statements that can’t all be true at the same time (though they can all be false).

C ⦁ ~M and C ≣ M are inconsistent

17
Q

Logical Equivalence

A

Two statements that generate identical truth tables.

E.g. ~(A ⦁ B) is logically equivalent to ~A ⋁ ~B

18
Q

Logical Operator

A

Special symbols that are used to modify or combine simple statements.

19
Q

Main Operator

A

The logical operator that has in its range the largest component or components in a compound statement.

20
Q

Negation

A

Negation switches the truth value of the proposition it is applied to.

Symbolized by the tilde ~. We use this symbol to translate phrases like “not” or “it is not the case that…”

21
Q

Self-Contradiction

A

A statement that is always false

E.g. P ⦁ ~P

22
Q

Simple Statement

A

Statements that do not have any other statement as a component. E.g. “It is hot today.”

23
Q

Tautology

A

A statement that is always true

E.g. P ⋁ ~P

24
Q

Well-Formed Formula

A

In our system, we will call “grammatically” correct statements Well-Formed Formulas (WFF)

25
Modus Ponens
A valid argument form: p ⊃ q p /q
26
Fallacy of Affirming the Consequent
An invalid argument form: p ⊃ q q /p
27
Modus Tollens
A valid argument form: p ⊃ q ~q /~p
28
Fallacy of Denying the Antecedent
Invalid argument form: p ⊃ q ~p /~q