$\newcommand{\classG}{\mathcal{G}}$
To facilitate discussion, let's first settle the probability space to be $(\Omega, \mathcal{H}, P)$, and let $\mathcal{G}$ be a sub-$\sigma$-algebra of $\mathcal{H}$. The complete sentence that the author wrote is:
Cinlar
advocates for thinking of the sub-$\sigma$-algebra $\mathcal{G}$ both as a collection of events (i.e., measurable subsets
of $\Omega$), and as the collection of all numerical random variables that are $\classG$-measurable.
The first part of the quote is obvious: by definition $\classG$ (in fact any subclass $\mathcal{A}$ of $\mathcal{H}$) is a collection of events.
Mechanically speaking, the second part of the quote does not make sense, because $\classG$ is a class of sets, instead of random variables (i.e., functions defined on $\Omega$). However, such "thinking" does make sense in view of the following isomorphism $\tau$ between $\classG$ and $\mathscr{I}$, which is defined as the class of indicator functions of events in $\classG$: for every $G \in \classG$, define $\tau(G) = I_G(\omega), \omega \in \Omega$. Now $\mathscr{I} = \{I_G: G \in \classG\}$ is a collection of numerical random variables that are $\classG$-measurable -- intuitively, for each $\omega \in \Omega$, knowing the value of $I_G(\omega)$ is equivalent to knowing if the event $G$ occurs, that is, if $\omega \in G$. In addition, $\tau$ is obviously a bijective between $\classG$ and $\mathscr{I}$. This justifies the second part of the quote.
For more enlightening discussion on sub-$\sigma$-algebra and its heuristic relation to partial information, I recommend you reading the Subfields subsection in Section 4 of Probability and Measure by Patrick Billingsley.