- #1
honestrosewater
Gold Member
- 2,143
- 6
I want to prove some various but closely-related things about a language, so if I need help later on, I'll just add it here. Definitions are in indigo.
The primitive symbols of formal language L fall into two disjoint sets: a countably infinite set of propositional symbols and a non-empty finite set of connective symbols. The set S of primitive symbols is then countably infinite.
A string of length n is a map from {1, 2, 3, ..., n} to S. The empty string has length 0. Conjecture: The set G of strings is countably infinite.
I got this idea from seeing Cantor's diagonal process. Let Gn denote the set of strings of length n. Then G is countable if each Gn is at most countable. G0 has one member. G1 = S, so is countable. For G2, consider the infinite array, where pn is a primitive symbol:
p1p1, p1p2, p1p3, ...
p2p1, p2p2, p2p3, ...
p3p1, p3p2, p3p3, ...
...
Then the members of G2 can be arranged in the sequence:
(p1p1; p2p1, p1p2; p3p1, p2p2, p1p3; ...). So G2 is countable.
I can't think of a way to visualize the process for higher Gns, but here's the idea, with G3 as an example. Arrange the members of G3 into a sequence by groups. Let group 1 contain all arrangements of p1: p1p1p1. Let group 2 contain all arrangements of p1 and p2 not in group 1 (I'll just write the subscripts): 112, 121, 122, 211, 212, 221, 222. Let group M contain all arrangements of p1, p2, ..., pM not in previous groups. Put the members of each group into the sequence. Then the sequence contains all members of G3 and is countable.
Do the same for each remaining Gn. Then every Gn is at most countable.
Does that work? Make sense?
The primitive symbols of formal language L fall into two disjoint sets: a countably infinite set of propositional symbols and a non-empty finite set of connective symbols. The set S of primitive symbols is then countably infinite.
A string of length n is a map from {1, 2, 3, ..., n} to S. The empty string has length 0. Conjecture: The set G of strings is countably infinite.
I got this idea from seeing Cantor's diagonal process. Let Gn denote the set of strings of length n. Then G is countable if each Gn is at most countable. G0 has one member. G1 = S, so is countable. For G2, consider the infinite array, where pn is a primitive symbol:
p1p1, p1p2, p1p3, ...
p2p1, p2p2, p2p3, ...
p3p1, p3p2, p3p3, ...
...
Then the members of G2 can be arranged in the sequence:
(p1p1; p2p1, p1p2; p3p1, p2p2, p1p3; ...). So G2 is countable.
I can't think of a way to visualize the process for higher Gns, but here's the idea, with G3 as an example. Arrange the members of G3 into a sequence by groups. Let group 1 contain all arrangements of p1: p1p1p1. Let group 2 contain all arrangements of p1 and p2 not in group 1 (I'll just write the subscripts): 112, 121, 122, 211, 212, 221, 222. Let group M contain all arrangements of p1, p2, ..., pM not in previous groups. Put the members of each group into the sequence. Then the sequence contains all members of G3 and is countable.
Do the same for each remaining Gn. Then every Gn is at most countable.
Does that work? Make sense?
Last edited: