Im trying to understand the basics of sets and subsets in Set Theory in relations to binary (base-2) computation (not to be confused with binary relations which I do not know anything about).
Lets say I have a binary string of length n = 9. i.e. a binary number. n could be anything, but I just use this as an example.
If A is a set of only one binary number. Or where the set of {0, 1} are the elements.
Can one define a subset of a bitstring like this:
And how would one go about writing this in math notation?
What can I call sets, and subsets? Is the binary string of length n-1 (with copies from the original string excluding one bit) a subset?
My question regards finite bitstring of length n. And what its terminology are to Set Theory if one take an arbitrary substring of that string.
Thank you.