- Subclass (set theory)
In

set theory and its applications throughoutmathematics , a**subclass**is a class contained in some other class in the same way that asubset is a set contained in some other set.That is, given classes

*A*and*B*,*A*is a subclass of*B*if and only if every member of*A*is also a member of*B*.If*A*and*B*are sets, then of course*A*is also a subset of*B*.In fact, it's enough that*B*be a set; theaxiom of specification essentially says that*A*must then also be a set.As with subsets, the

empty set is a subclass of every class, and any class is a subclass of itself. But additionally, every class is a subclass of the class of all sets. Accordingly, the subclass relation makes the collection of all classes into aBoolean lattice , which the subset relation does not do for the collection of all sets. Instead, the collection of all sets is an ideal in the collection of all classes. (Of course, the collection of all classes is something larger than even a class!)

*Wikimedia Foundation.
2010.*

### Look at other dictionaries:

**Positive set theory**— In mathematical logic, positive set theory is the name for a class of alternative set theories in which the axiom of comprehension* {x mid phi} exists holds for at least the positive formulas phi (the smallest class of formulas containing atomic… … Wikipedia**Morse–Kelley set theory**— In the foundation of mathematics, Morse–Kelley set theory (MK) or Kelley–Morse set theory (KM) is a first order axiomatic set theory that is closely related to von Neumann–Bernays–Gödel set theory (NBG). While von Neumann–Bernays–Gödel set theory … Wikipedia**Zermelo–Fraenkel set theory**— Zermelo–Fraenkel set theory, with the axiom of choice, commonly abbreviated ZFC, is the standard form of axiomatic set theory and as such is the most common foundation of mathematics.ZFC consists of a single primitive ontological notion, that of… … Wikipedia**Implementation of mathematics in set theory**— This article examines the implementation of mathematical concepts in set theory. The implementation of a number of basic mathematical concepts is carried out in parallel in ZFC (the dominant set theory) and in NFU, the version of Quine s New… … Wikipedia**Von Neumann–Bernays–Gödel set theory**— In the foundations of mathematics, von Neumann–Bernays–Gödel set theory (NBG) is an axiomatic set theory that is a conservative extension of the canonical axiomatic set theory ZFC. A statement in the language of ZFC is provable in NBG if and only … Wikipedia**Subclass**— may refer to:* Subclass (biology), a taxonomic rank intermediate between class and superorder * Subclass (computer science), a class that is derived from another class or classes * Subclass (database theory), a class which inherits its data… … Wikipedia**Theory of computation**— In theoretical computer science, the theory of computation is the branch that deals with whether and how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata… … Wikipedia**Hereditarily finite set**— Nested set redirects here. Nested set may also refer to the Nested set model in relational databases … Wikipedia**Combinatorial game theory**— This article is about the theory of combinatorial games. For the theory that includes games of chance and games of imperfect knowledge, see Game theory. Mathematicians playing Konane at a Combinatorial game theory workshop (for technical content … Wikipedia**Bounded set**— In mathematical analysis and related areas of mathematics, a set is called bounded, if it is, in a certain sense, of finite size. Conversely a set which is not bounded is called unbounded. Definition A set S of real numbers is called bounded from … Wikipedia