Recursive Set
Need a Solution to the following question
Let ? be the alphabet defined as follows: ? = {e, l, v}
We now deifine the set of strings P according to the following:
BASIS STEP: If x ? ? then x ? P
RECURSIVE STEP: If ? ? P and x ? ?, then x?x ? P
Show that the string level is in P

Thanks for replying Please provide full answers, and please solve them in a way that a someone who semiunderstands (me) can comprehend and study it in the future.
Answer
Answers can be viewed only if
 The questioner was satisfied and accepted the answer, or
 The answer was disputed, but the judge evaluated it as 100% correct.

Will greatly appreciate if you could please provide step by step full answer, and please solve it in a way that someone who semiunderstands (me) can comprehend and study it in the future.

There is nothing more to say, the answer is as full as it can get.
The answer is accepted.
 answered
 193 views
 $3.00
Related Questions
 Logic Question ¬¬𝐴→𝐴
 Find an expression for the total area of the figure expressed by x.
 Function Invertibility/Inverse & Calculus, One question. Early Uni/College level
 Calculus  functions, limits, parabolas
 Finding a unique structure of the domain of a function that gives a unique intuitive average?
 Logic Questions (𝐴→𝐶)∧(𝐵→𝐶)⊢(𝐴∧𝐵)→𝐶
 Optimization of a multiobjective function
 In how many different ways $n$ persons can seat around a round table?