The word “Garsh” in binary code.

[quote=Pear]The word “Garsh” in binary code.[/quote]

@Pear 01000111 01100001 01110010 01110011 01101000

🟩

1

For all R { {for any (coded) formula [ψ] and any variable assignment t (R([ψ],t) ↔ (([ψ] = "xi ∈ xj" ∧ t(xi) ∈ t(xj)) ∨ ([ψ] = "xi = xj" ∧ t(xi) = t(xj)) ∨ ([ψ] = "(∼θ)" ∧ ∼R([θ],t)) ∨ ([ψ] = "(θ∧ξ)" ∧ R([θ],t) ∧ R([ξ],t)) ∨ ([ψ] = "∃xi (θ)" and, for some an xi-variant t' of t, R([θ],t')) )} → R([φ],s)}

I've gotta mention that I don't understand this, I saw it in a Numberphile video

how did you guys already mess this up

I mean, I failed out of kindergarten, but I don't know about the rest of these clowns

TREE(3)