(Terminology) bijective correspondence between proper classes?

Fredrik
Staff Emeritus
Science Advisor
Homework Helper
Insights Author
Gold Member
Messages
10,876
Reaction score
423
I'm just looking for the right words to use to talk about something like the "bijective correspondence" between the class of groups defined as pairs and the class of groups defined as 4-tuples. I'm talking about the "map" ##(G,\star,i,e)\mapsto (G,\star)##. It seems to me that it shouldn't be called "map", "function", "bijection" or anything like that, since its "domain" and "codomain" aren't sets. So is there something we can call it?
 
Physics news on Phys.org
Check Jech's "Set theory" page 11 and 12. He defines functions (and thus bijections, etc.) simply as classes. So a function isn't necessarily between set according to his terminology.

However, he does always seem to be careful to make sure the reader knows it's a class. For example, check the replacement schema on page 13. He says "If the class ##F## is a function then...". In this case, we know ##F## isn't necessarily a set and thus that the domain and codomain aren't necessarily sets. This is different from saying "Take the function ##F## then..." which is more ambiguous.

So if I were you, I would use the same terminology, but I would make it clear we're dealing with classes.
 
Thank you, that's exactly what I needed. I don't think I've seen those more general definitions of relation, function and operation before, but now that I have them in front of me, they seem very natural.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Replies
10
Views
4K
Replies
1
Views
3K
Replies
13
Views
568
Replies
3
Views
434
Replies
9
Views
2K
Replies
2
Views
3K
Back
Top