# Why do we need "alphabets" defined?

I'm reading over my computational theory book before quarter starts and it's giving me the following definitions.

alphabet: any nonempty finite set

symbols: members of the alphabet

I don't understand the relevance of why this term even needs to be defined. It seems unnecessary. What exactly differentiates this from any regular set that has a cardinality greater than 0?

• Nothing but the context in which the term is used. The terminology turns out to be useful, and it’s the terminology that’s being defined here, not the concepts. Dec 20, 2013 at 0:51
• Oh, I see. Contextually useful. Simple enough. Thanks! Dec 20, 2013 at 0:52
• You’re welcome! Dec 20, 2013 at 0:53
• Just as a heads up, there are sets of cardinality strictly greater than zero that are not finite. Dec 20, 2013 at 0:54
• Yes, I had the same issue with forcing. When I started learning about that the term "forcing notion" is just a partial order. Why not use "partial order"? Now I know that when you say "forcing notion" you effectively set the context for using the partial order and it allows you to skip some assumptions on that order (e.g. it has a maximum, the terms "stronger" and "extending", and so on). Dec 20, 2013 at 1:14