Is there a notion similar to a power set for permuted and ordered elements?

Shaun Culver
Messages
69
Reaction score
0
I would like if there is a notion similar to that of a "power set" where the order of the elements in a set is accounted for - the elements are permuted, and each arrangement is considered to be a separate set.

For example:

For three singletons: {X},{Y}, & {Z} in a set S, the "ordered & permuted power set" would consist of the following subsets:

{Empty}
{X}; {Y}; {Z};
{X,Y}; {Y,X}; {X,Z}; {Z,X}; {Y,Z}; {Z,Y}
{X,Y,Z}; {X,Z,Y}; {Y,X,Z}; {Z,X,Y}; {Y,Z,X}; {Z,Y,X}
 
Physics news on Phys.org
Please excuse my inexperience - I am new to set theory.
 
Correction: In post #1, after the first three words, "I would like...", please add, "...to know...".
 
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
3
Views
2K
Replies
1
Views
2K
Replies
5
Views
2K
Replies
4
Views
2K
Replies
28
Views
6K
Replies
2
Views
2K
Replies
6
Views
2K
Back
Top