To test this hypothesis, we first collect examples of the form (e, f, e , f ), where e = ¬e, rep(e) = rep(f ), and rep(e ) = rep(f ).
we find pairs of pairs of RNN representations f and f for which the natural language messages (e, e ) serve as a denotational certificate that f behaves as a negation of f .