Formally, you would need to set up a Kuhn-Karush-Tucker-Problem with the two inequality constraints $N_t<1$ and $N_t>0$. Plugging in for consumption, you get the Lagrangian
$
L = \sum\limits_{t = 0}^\infty {{\beta ^t}\ln \left( {\left( {1 - \delta } \right){K_t} + K_t^\alpha N_t^{1 - \alpha } - {K_{t + 1}}} \right)} + {\beta ^t}{\lambda _{1,t}}\left( {1 - {N_t}} \right) + {\beta ^t}{\lambda _{2,t}}\left( {0 + {N_t}} \right)
$
with the relevant first order conditions:
\begin{gathered}
\frac{{\partial L}}{{\partial {N_t}}} = {\beta ^t}\frac{1}{{\left( {\left( {1 - \delta } \right){K_t} + K_t^\alpha N_t^{1 - \alpha } - {K_{t + 1}}} \right)}}\left( {1 - \alpha } \right)\left( {K_t^\alpha N_t^{ - \alpha }} \right) - {\beta ^t}{\lambda _{1,t}} + {\beta ^t}{\lambda _{2,t}} = 0 \hfill \\
{\lambda _{1,t}}\left( {1 - {N_t}} \right) = 0 \hfill \\
{\lambda _{2,t}}\left( {0 + {N_t}} \right) = 0 \hfill \\
\end{gathered}
The last two are the complementary slackness conditions. You need to check the three cases of
- no constraint is binding (interior solution) or
- the lower bound is binding ($N=0$) or
- the upper bound is binding ($N=1$)
We do this in turn:
- If the inequality constraints were non-binding, the first condition implies
\begin{gathered}
\frac{{\partial L}}{{\partial {N_t}}} = {\beta ^t}\frac{1}{{\left( {\left( {1 - \delta } \right){K_t} + K_t^\alpha N_t^{1 - \alpha } - {K_{t + 1}}} \right)}}\left( {1 - \alpha } \right)\left( {K_t^\alpha N_t^{ - \alpha }} \right) = 0\\
\Rightarrow \frac{1}{{N_t^\alpha }} = 0 \\
\Rightarrow {N_t} = \infty
\end{gathered}
This is a contradiction.
Next, if $N_t=0$, then $\lambda_{1,t}=0$ and $\lambda_{2,t}=-\infty$. The multiplier must be positive, thus this is not a solution.
Finally, if $N_t=1$, then $\lambda_{2,t}=0$ and
$
{\lambda _{1,t}} = \frac{1}{{\left( {\left( {1 - \delta } \right){K_t} + K_t^\alpha - {K_{t + 1}}} \right)}}\left( {1 - \alpha } \right)\left( {K_t^\alpha } \right) > 0
$
which is the solution.
This formally proves that with no disutility of labor, the maximum feasible amount will be chosen.