C1-3 Flashcards

(33 cards)

1
Q

What is the existential quantifier symbol?

A

3 for some

It indicates that there exists at least one element for which the statement is true.

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

What does negate mean in logic?

A

to reverse the truth value of a statement

For example, negating a true statement makes it false.

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

What is a tautology?

A

always true (i.e., PV TP)

A statement that is true in every possible interpretation.

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

What is the complement rule in logic?

A

PV TP = T

This states that the disjunction of a proposition and its negation is always true.

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

What does P^ -P = F signify?

A

a proposition and its negation cannot both be true

This is a fundamental principle in logic.

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

What is the identity rule in logic?

A

P ∧ T = P

A proposition AND true is the proposition itself.

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

What is the idempotent law?

A

P ∧ P = P

A proposition AND itself is the proposition.

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

What does the commutative law state?

A

P ∧ Q = Q ∧ P

The order of propositions does not affect the outcome.

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

What is the associative law?

A

(P ∧ Q) ∧ R = P ∧ (Q ∧ R)

The grouping of propositions does not affect the outcome.

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

What is the distributive law?

A

P ∧ (Q ∨ R) = (P ∧ Q) ∨ (P ∧ R)

This shows how conjunction distributes over disjunction.

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

What does double negation mean?

A

P = ¬(¬P)

Negating a negation returns the original proposition.

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

What is De Morgan’s law?

A

¬(P ∧ Q) = ¬P ∨ ¬Q

It describes how negation interacts with conjunction and disjunction.

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

What is the converse of P → Q?

A

Q → P

The converse switches the hypothesis and conclusion.

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

What is the contrapositive of P → Q?

A

¬Q → ¬P

The contrapositive is logically equivalent to the original statement.

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

What are the operations in algebra?

A
    • or •

These symbols represent multiplication in algebraic expressions.

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

What is the identity property in algebra?

A

m + 0 = m and 0 + m = m

Adding zero to a number does not change its value.

17
Q

What does negation mean in algebra?

A

m + (-m) = 0

A number plus its negative equals zero.

18
Q

What is the commutative property in algebra?

A

m + n = n + m and m • n = n • m

The order of addition or multiplication does not affect the result.

19
Q

What is the associative property in algebra?

A

(m + n) + p = m + (n + p) and m • (n • p) = (m • n) • p

The grouping of numbers does not affect the result.

20
Q

What is the distributive property?

A

m • (n + p) = m • n + m • p

This shows how multiplication distributes over addition.

21
Q

What does m • n = 0 imply?

A

either m = 0 or n = 0

This is a property of multiplication in algebra.

22
Q

What is an order relation?

A

≤ (less than or equal to)

It defines how elements are compared in terms of size.

23
Q

What does reflexive mean in order relations?

A

every integer m satisfies m ≤ m

Each element is related to itself.

24
Q

What is the antisymmetric property?

A

if m ≤ n and n ≤ m, then m = n

This indicates that if two elements are mutually related, they are equal.

25
What is the **transitive** property?
if m ≤ n and n ≤ p, then m ≤ p ## Footnote This shows a chain of relationships among elements.
26
What does **comparability** mean?
given two integers, either m ≤ n or n ≤ m ## Footnote This indicates that any two elements can be compared.
27
What is the **shift** property?
if m ≤ n, then m + s ≤ n + s ## Footnote Adding the same value to both sides preserves the inequality.
28
What is the **scale** property?
if m ≤ n and 0 ≤ p, then m • p ≤ n • p ## Footnote Multiplying both sides by a positive number preserves the inequality.
29
What is the **well ordering** principle?
any non-empty subset of Z* has a unique least element ## Footnote This principle applies to the set of positive integers.
30
What does the **remainder theorem** state?
there is a unique q and r such that a = qb + r and 0 ≤ r < b ## Footnote This theorem describes the division of integers.
31
What is the formula for **absolute value**?
|n| = * n if n ≥ 0 * -n if n < 0 ## Footnote Absolute value measures the distance of a number from zero.
32
What is **Euclid's algorithm** used for?
to find the greatest common divisor (gcd) ## Footnote It involves subtracting the smaller number from the larger until reaching zero.
33
What is **Bézout's identity**?
if a and b are nonzero, then there exist integers j and v such that gcd(a, b) = au + bu ## Footnote This identity relates the gcd to linear combinations of the integers.