How we can prove that the logical result of $\{(p_i \vee $~ $p_{i+1}$$) $$: i \in \mathbb{N} \}$ is effectively enumerable ?
Update: as one user requests, I add my method. I use truth table for check the result but I'm sure there is a flaw and other method must be used.