Propositions Flashcards

1
Q

Logic is the science of…

A

reasoning.

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

Propositions are also known as…

A

statements.

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

A proposition can be both true and false.

A

False.

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

A proposition should be in this form.

A

Declarative.

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

It is the symbol for negation.

A

“¬ or ~”.

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

It is the symbol for conjunction.

A

”^”.

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

It is the symbol for disjunction.

A

“v”.

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

It is the symbol for conditionals.

A

“→”.

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

It is the symbol for biconditionals.

A

“↔”.

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

A truth table is a tabular
representation of…

A

all the combinations of values for inputs and their corresponding outputs.

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

A truth table contains T’s and F’s or…

A

1’s and 0’s.

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

What is a compound proposition?

A

A proposition combining 2 or more propositions.

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

What is the rule in conjunctions?

A

a compund proposition is true if and only if both are true. Otherwise, false.

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

What is the rule in disjunctions?

A

A compound proposition is false if and only if both are false. Otherwise, true.

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

~p^~q ≡ ~(pvq); ~pv~q ≡ ~(p^q). This is explained by…

A

De Morgan’s Law.

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

“≡” is read as…

A

logical equivalence.

17
Q

Having logical equivalence means…

A

compound propositions have the same truth values.

18
Q

What is the rule in exclusive disjunctions?

A

A compound proposition is true when exactly one of the propositions is true. Otherwise, false.

19
Q

It is the symbol for exclusive disjunction.

A

“⊕”.

20
Q

What is the rule for NAND’s?

A

A compound proposition is false when both propositions are true. Otherwise, true.

21
Q

They are the symbols for NAND’s.

A

“NAND” or “|”.

22
Q

All but the last proposition in an arguement are _.

A

premises

23
Q

The last proposition in an arguement is a _.

A

conclusion

24
Q

An arguement is valid if the conclusion is false (tautology).

A

False. True.