Chapter 4 - Logic Flashcards

(30 cards)

1
Q

This is the study of the methods and principles used in distinguishing correct from incorrect arguments.

A

Logic

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

Logic focuses on the _____ as opposed to the content of any
particular statement.

A

relationship among statements

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

A set of proposition/s that provides
grounds or reasons for accepting
the conclusion.

A

Premise

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

A proposition that is affirmed on the basis of the other propositions of the argument

A

Conclusion

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

This is denoted by lower case letters such as p, q and r, is a sentence that is either true or false or has a truth value.

A

Proposition

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

An argument is valid when the relationship of its premise and conclusion is such that it is _______ unless the conclusion is
___.

A

impossible for the premise to be true, also true

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

When it is possible for the premise of an argument to be true but
its conclusion is false then the argument is _____.

A

invalid

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

A conjunction is true if _______; otherwise, it is false.

A

both of its conjuncts are true

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

A disjunction is true if _____; otherwise, it is false.

A

at least one of the disjuncts is true

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

A disjunction will be false only when ______.

A

both of its disjuncts are false

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

A conjunction will be false when ______.

A

at least one of its conjuncts is false

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

some words used to indicate the conjunction include:

A

‘moreover’
‘furthermore’
‘but’
‘yet’
‘still’
‘however’
‘also’
‘nevertheless’
‘although’

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

The negation of a true statement is ____ and the negation of a false statement is ____.

A

false, true

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

The hierarchy of connectives is as follows: ____ first, then _____, then ____

A

~ first, then ∧, then ∨.

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

This describes the truth-value of a compound proposition for each possible scenario.

A

Truth table

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

A proposition that is true for all possible truth-values of its constituent propositions is called a _______.

17
Q

A proposition that is false for all possible truth-values of its constituent propositions is called a ____.

A

contradiction

18
Q

A proposition that is neither a tautology nor a contradiction is said to be a ______.

19
Q

If p and q are propositions, the compound proposition if p then q is called a______ (p implies q or implication of q by p) and is denoted by p→q.

A

conditional proposition

20
Q

In a conditional proposition p→q, the proposition p is called the ____ and the proposition q is called the _____

A

hypothesis (antecedent), conclusion (consequent)

21
Q

We say that P is a ______ for Q when it is impossible for Q to be false when P is true.

A

sufficient condition

22
Q

We say that P is a ______ for Q when it is impossible for Q to be true when P is false.

A

necessary condition

23
Q

What is the converse of p→q?

24
Q

What is the inverse of p→q?

25
What is the contrapositive of p→q?
~q→~p
26
The compound statement (p→q) ∧ (q→p) is called the ________
biconditional or equivalence proposition
27
P and Q are said to be ______, denoted by P≡Q, if P and Q have the same truth-value for every possible choice of truth-values for the propositions involved in P and Q.
logically equivalent
28
To prove that P and Q are logically equivalent, you can show that ___.
the biconditional proposition P↔Q is a tautology; that is, P is both necessary and sufficient for Q.
29
Let P(x) be a statement involving the variable x and let D be a set. We call P(x) a ______ with respect to D
propositional function
30
A propositional function P(x), by itself is neither ____.
true nor false