Week 1: Sets and Numbers Flashcards

1
Q

Extensive Notation

A

Specifying a set by listing its members one by one, e.g., {James, Daniel, Robert}.

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

Intensive Notation

A

Specifying a set by stating a condition fulfilled by all and only its members, e.g., {x: x was a cast member of The Walking Dead}.

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

Membership notation

A

We use the symbol ∈ to denote “is a member of”.

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

Axiom of Extensionality

A

Sets A and B are one and the same set if and only if every member of A is a member of B, and vice versa.

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

Axiom of Comprehension

A

For any condition C, there is a set A of things that fulfill condition C.

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

Union of sets

A

The union of sets A and B, noted A ∪ B, is the set of things that are in A or in B.

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

Intersection of sets

A

The intersection of sets A and B, noted A ∩ B, is the set of things that are in both A and B.

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

Empty set

A

The empty set, denoted by ∅, is a set with no members.

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

Subset

A

A set A is a subset of set B, denoted A ⊆ B, if and only if every member of A is also a member of B.

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

Proper subset

A

A set A is a proper subset of set B, denoted A ⊂ B, if and only if every member of A is also a member of B, and A is not equal to B.

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

Russell’s Paradox

A

A paradox that arises from considering the set of all sets that do not contain themselves as a member. It shows that naive set theory is incoherent.

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

Pairing, empty set and union Axioms

A

Axioms that define the empty set, pairing of sets, and union of sets in set theory. They are basic principles used to construct and manipulate sets.

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

Power set axiom

A

The power set of a set A, noted P(A), is the set of all subsets of A. The power set axiom states that for any set A, there exists a set P(A) which is the power set of A.

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

Power set axiom

A

The power set of a set A, noted P(A), is the set of all subsets of A. The power set axiom states that for any set A, there exists a set P(A) which is the power set of A.

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

Inclusion

A

A set A is included in a set B if and only if anything that is a member of A is a member of B. Inclusion refers to the relationship between sets, whereas membership refers to the relationship between an element and a set.

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