What is the difference between class and set?

Click For Summary
The discussion clarifies that a class is a broader collection of objects, while a set is a specific type of class that adheres to certain axiomatic criteria. Sets exist within models of set theory, and not all classes qualify as sets; those that do not are termed proper classes. Operations permissible with sets, such as being a member of another set, are prohibited for proper classes. The distinction hinges on axioms that determine whether a class can be considered a set. Ultimately, all sets are classes, but not all classes are sets, emphasizing the foundational role of axioms in this classification.
chingkui
Messages
178
Reaction score
2
What is the difference between class and set? I have seen statements like "Let M be a class of subsets of X...", and it seems to me we can still do everything we like as though M is a set, and we are just avoiding the word "set" and replace it with "class". I am aware of the paradox "the set of all sets..." lead to, my question is what exactly is the difference between class and set? What sort of operations is prohibited in class while we can do in sets? How should we judge whether "class" rather than "set" is appropriate when describing a collection of sets? Thanks.
 
Physics news on Phys.org
You need to learn what a set is first. Simply put something may or may not be a set. Really when we say X is a set we mean X is a set in some model of some axiomatic set theory. Confusing? Try this for starters:

www.maths.bris.ac.uk/~maxmg/maths/philosophy/sets.html[/URL]

Loosele, a Class is a collection of objects. Something is a set *in some model*, it's just an extra label that we can apply to a class.

For instance we agree that the rational numbers exist and have the properties we think they do? They also are a group. That is we can add the label "group" to them. But we had the rationals before the label group was invented...
 
Last edited by a moderator:
In my book, all the objects in the universe are sets. Classes are not necessarily objects. (Whether something is an object is the whole point.) Classes are extensions of properties (the class of all objects having some definite property). You basically start with a class and look at your axioms to determine whether the class is a set or not. So all sets are classes, but not all classes are sets. Those classes that aren't sets are called proper classes and cannot be members of any class or do anything that would make them a set, like being a subset of a set or whatever your rules say. For instance, the universe is usually a proper class. The empty class is usually a set.
So in the beginning, everything is a class. You then add some axioms, allowing some classes to be sets. At least, that's how I'd sum it up. If you want a more formal grounding, you can read a little about models, like matt says.
 
Last edited:
The standard _A " operator" maps a Null Hypothesis Ho into a decision set { Do not reject:=1 and reject :=0}. In this sense ( HA)_A , makes no sense. Since H0, HA aren't exhaustive, can we find an alternative operator, _A' , so that ( H_A)_A' makes sense? Isn't Pearson Neyman related to this? Hope I'm making sense. Edit: I was motivated by a superficial similarity of the idea with double transposition of matrices M, with ## (M^{T})^{T}=M##, and just wanted to see if it made sense to talk...

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 14 ·
Replies
14
Views
5K
  • · Replies 10 ·
Replies
10
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
6K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
10
Views
12K
  • · Replies 7 ·
Replies
7
Views
9K
  • · Replies 6 ·
Replies
6
Views
3K
Replies
4
Views
2K