A) Peano arithmetic B) Zermelo–Fraenkel set theory without choice C) Zermelo–Fraenkel set theory including the axiom of choice D) Intuitionistic set theory
A) There is no specific constraint given for I B) I must be a countable set C) I must be a finite set D) I must be a well-ordered set
A) A_i ≤ B_i B) A_i = B_i C) A_i > B_i D) A_i < B_i
A) There is a bijection between A and B B) A is a subset of B C) There is no function from A onto B and B is nonempty D) B is a subset of A
A) By definition of the summation B) By assuming the product is infinite C) Using the axiom of choice and the fact that factors are nonempty D) By proving the index set is finite
A) That the function is constant B) That the function is bijective C) That the function is injective D) That the function is not surjective
A) An element a_i in A_i B) The product of all B_i C) An element b_i in B_i not in the image of A_i D) The union of all A_i
A) The identity function B) The summation over I C) The projection to B_i D) The product over I
A) Because the function f is surjective B) Because each component does not match the image of f C) Because A_i is empty D) Because the product is empty
A) f is a constant function B) f is injective C) f does not map the disjoint union of A_i onto the product of B_i D) the product is equal to the sum
A) κ > κcf(κ) B) κ = κcf(κ) C) κ < κcf(κ) D) κ ≤ κcf(κ)
A) Zorn's lemma B) Easton's theorem C) Cantor's theorem D) Well-ordering theorem
A) The sum is undefined B) The sum is less than κ C) The sum equals κ D) The sum is greater than κ
A) Cantor's theorem B) Easton's theorem C) Schröder-Bernstein theorem D) Kőnig's theorem
A) κ > cf(λ^κ) B) κ ≤ cf(λ^κ) C) κ < cf(λ^κ) D) κ = cf(λ^κ)
A) μ > μ B) μ < μ C) μ is empty D) μ = 0
A) κ > 2^κ B) κ < 2^κ C) κ + 1 = 2^κ D) κ = 2^κ
A) At the same time B) Much earlier C) It remains unproven D) Much later |