Say that I will use DDS with T = N.

I don't want to mess with negative time and whatever that may imply.

deal.tex

@@ -551,8 +551,9 @@ the iteration of $F$: $\{F^k(s) \mid k \in \mathbb{N}\}$, where
 $F^0(s) = s$, $F^1(s) = F(s)$, $F^2(s) = F(F(s))$, etc.
 
 While I will give most of the general definitions for abstract
-dynamical systems, I will rely on discrete-time dynamical systems
-later on in the manuscript, for the following reasons:
+dynamical systems, I will rely on discrete-time dynamical systems with
+$T = \mathbb{N}$ later on in the manuscript, for the following
+reasons:
 \begin{enumerate}
 \item discrete time yields simpler formal systems, which can capture
   a wider range of features before becoming too complex to comprehend,