A) Axioms 1–8 B) Axioms 2–9 C) Axioms 1–9 D) Axioms 1–7
A) The axiom of infinity B) The well-ordering theorem C) The axiom of extensionality D) The axiom of regularity
A) It is a theorem of first-order logic that something exists B) It is assumed that the domain of discourse is empty C) The axiom of specification implies it D) The axiom of extensionality implies it
A) It is only guaranteed if the domain is finite B) In free logic where first-order logic does not prove existence C) It is never guaranteed by the axiom of infinity D) It only exists in the axiom of pairing
A) Two sets are equal if they have the same rank B) Two sets are equal if they have the same elements C) No set is an element of itself D) Every set has a unique subset
A) The axiom of substitution B) The axiom of specification C) The axiom of foundation D) The axiom of union
A) It contains an empty set B) It is an element of itself C) It contains a member disjoint from itself D) It must be infinite
A) All sets are finite B) There exists an empty set C) Every set is unique D) No set is an element of itself
A) Axiom of separation or restricted comprehension B) Axiom of infinity or union C) Axiom of identity or equality D) Axiom of choice or foundation
A) To force the existence of the empty set B) To avoid Russell's paradox C) Because sets cannot contain other sets D) To increase the speed of proofs
A) The uniqueness of the empty set B) The well-ordering theorem C) Russell's paradox D) The existence of an ordinal rank
A) By the axiom of infinity B) By the axiom of regularity C) By the axiom of extensionality D) By using a property that no set has
A) It depends on the set w B) It does not exist C) It is unique D) It contains itself
A) The axiom of choice is unnecessary B) Every set has an ordinal rank C) The empty set does not exist D) Russell's paradox is resolved
A) Georg Cantor and Gottlob Frege B) Ernst Zermelo and Abraham Fraenkel C) Kurt Gödel and John von Neumann D) Bertrand Russell and Paul Bernays
A) The von Neumann universe B) The Russellian hierarchy C) The Zermelo collection D) The Fraenkel universe
A) aleph-null B) aleph-omega C) aleph-one D) aleph-zero
A) As a primitive logical symbol B) As a non-logical predicate C) As a set operator D) As a quantifier
A) An equality relation B) A binary relation C) A ternary relation D) A unary relation
A) An uncountable number B) A countably infinite number C) A finite number D) Zero
A) x ∧ y B) x = y C) ¬x D) ∀xϕ
A) Uncountably infinitely many B) Only one C) Countably infinitely many D) Finitely many
A) psi B) I_in C) phi D) mu
A) Membership relation B) Domain interpretation function C) Variable assignment function D) Truth value function
A) S is a subset of phi B) S satisfies phi C) S is equivalent to phi D) S contains phi
A) Any variable B) Any wff C) Any domain element D) Any constant
A) D B) The set of wffs C) A D) The set of relations
A) S assigns phi to the domain B) phi is a member of D C) phi is the interpretation of S D) S makes phi true
A) A B) φ C) w1 D) B
A) y B) B C) A D) x |