Propositions Flashcards

(85 cards)

1
Q

Declarative statements that have a true or false value.

A

Proposition

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

Statements contingent upon indefinite values can be propositions.

A

False

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

“x = 1” is a proposition.

A

False

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

“Pigs can fly” is a proposition

A

True

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

Propositions are defined/denoted using the…

A

Triple bar symbol (≡)

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

logical operators that join simple propositions into a more complex one

A

Connectives

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

¬

A

Negation

(NOT · · ·)

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

A

Conjunction

(· · · AND/BUT/YET · · ·)

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

A

Disjunction

(· · · OR · · ·)

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

A

Implication

(IF · · · , THEN · · ·)

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

A

Bi-Conditional

(· · · IF, AND ONLY IF, · · ·)

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

A

Exclusive Or

(· · · (English) OR · · ·)

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

(NOT · · ·)

A

negation (¬)

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

(· · · AND/BUT/YET · · ·)

A

conjunction (∧)

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

(· · · OR · · ·)

A

disjunction (∨)

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

(IF · · · , THEN · · ·)

A

implication (→)

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

(· · · IF, AND ONLY IF, · · ·)

A

bi-conditional (↔)

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

(· · · (English) OR · · ·)

A

exclusive or (⊕)

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

inverts the truth value of a proposition

A

negation (¬)

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

Suppose p ≡ “Birds can sing”, then ¬p ≡

A

“Birds cannot sing”

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

combines the truth value of two propositions

A

conjunctions and disjunctions

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

A conjunction is only True, when both propositions are…

A

True

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

A conjunction is False when at least one connected proposition is…

A

False

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

Suppose p ≡ “Birds can sing”, and q ≡ “Travis likes bagels”, then p ∧ q ≡ …

A

p ∧ q ≡ “Birds can sing, and Travis likes bagels”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Conjunctions give a lot of information when...
True
26
A disjunction is \_\_\_, when at least one connected proposition is true
True
27
A disjunction is \_\_\_when both connected propositions are False
False
28
Suppose p ≡ “I like bagels”, and q ≡ “My name isn’t Travis”, then p ∨ q ≡ ...
“I like bagels, or my name isn’t Travis”
29
When both statements are True a disjunction is...
True
30
True ∧ False
False
31
True ∨ False
True
32
¬ False
True
33
False ∧ False
False
34
\_\_\_, or conditions (→), are frequently used in mathematics.
Implication
35
p ≡ “You did your chores” q ≡ “You went to the park” p → q ≡ ...
p → q ≡ “If you did your chores, then you went to the park”, or p → q ≡ “You did your chores, implies you went to the park”
36
The two parts of an implication
pre-condition and post-condition
37
A ___ behaves like a contract or promise
Implication or Conditional
38
A conditional is always True when the post-condition is...
True
39
A conditional is True when the pre-condition is...
False
40
In regards to implication, ___ behaves conversely to "if".
"only if"
41
The ___ connective is used when implication holds in both directions.
bi-conditional (↔)
42
p ≡ “I studied”, q ≡ “I passed”, p ↔ q ≡ ...
p ↔ q ≡ “I studied, if and only if, I passed.”
43
requires that both statements are the same truth value
Bi-Conditional (↔)
44
"English or"
Exclusive Or (⊕)
45
is True when exactly 1 of the 2 statements are True.
Exclusive Or (⊕)
46
p ≡ “I studied”, q ≡ “I failed”, p ⊕ q ≡ ...
“I studied, or I failed, but not both.”
47
When both statements are True, then the “exclusive or” is
FALSE
48
Proposition Order of Operations
1. Negation, 2. Conjunction, 3. Disjunction, 4. Implication, 5. Bi-Conditional/Exclusive Or
49
False ∧ False ∨ True
TRUE
50
¬ False ∨ True
TRUE
51
¬ (False ∧ False) ∨ True
TRUE
52
True ∨ False → False
FALSE
53
True ∨ True → False
FALSE
54
True → True ∨ False
TRUE
55
True ↔ False ⊕ False
TRUE
56
A conditional can be made ___ by ensuring that the pre-condition is False
TRUE
57
A conditional can be made True by ensuring that the pre-condition is...
FALSE
58
Conditionals that have a False pre-condition are vacuously...
TRUE
59
Conditionals that have a False pre-condition are ___ True.
vacuously
60
Statements that have identical truth values for every possible assignment of truth-values for the simple statements are called...
Equivalent
61
In proofs, ___ can be substituted for each other.
Equivalent Statements
62
The triple bar (≡) is used to denote...
Equivalent Statements
63
Statements that have identical truth values for every possible assignment of truth-values for ____ are called Equivalent.
the simple statements
64
p ∧ p ≡ p
TRUE
65
q ∨ p ≡ p ∨ q
TRUE
66
q ∧ p ≡ p
FALSE
67
q ∨ p ≡ p
FALSE
68
¬ p ↔ q ≡ q ⊕ p
TRUE
69
¬ p → q ≡ q ∨ p
TRUE
70
a statement that results in True for all truth-value assignments of the simple statements
Tautology (T)
71
A Tautology, T, is a statement that results in ___ for all truth-value assignments of the simple statements.
TRUE
72
a statement that results in False for all truth-value assignments of the simple statements.
Contradiction (F)
73
A Contradiction, F, is a statement that results in ___ for all truth-value assignments of the simple statements.
FALSE
74
A statement is ___ if it is neither a Tautology nor a Contradiction.
Contingent
75
¬ p is contingent
TRUE
76
“To Be ∨ ¬ To Be” is a ___ because regardless of whether “To Be” is True or False at least one piece in the “or” is True.
tautology
77
¬ p → p. Tautology, Contradiction, or Contingent?
Contingent
78
p → p. Tautology, Contradiction, or Contingent?
Tautology
79
¬ p ∧ (p ∨ p). Tautology, Contradiction, or Contingent?
Contradiction
80
¬ p ∧ (q ∨ p). Tautology, Contradiction, or Contingent?
Contingent
81
p → (p ∨ q). Tautology, Contradiction, or Contingent?
Tautology
82
In a truth table, the number of combinations/rows is 2^N, where N is...
the number of simple statements
83
In a truth table, the last column of the simple statments will...
alternate between true and false
84
In a truth table, the first column top half...
is all true
85
In a truth table, the first column bottom half...
is all false