As the number of steps (N) introduced in a finite proof increases, the distinction between true and false becomes increasingly more difficult to discern, or at least the confidence placed in the entire assemblage begins to diminish. An infinite "proof" then requires that each step follow perfectly from those preceding it, rendering it increasing likely that a tactical or strategic mistake has been made. This is the case in Godel's Proof, though it may not be immediately apparent. Godel's Proof involves a "twist" at the end, turning "#### = G" into "####' = ~G". As this step has not proceeded logically from any previous step, I argue that it introduces a value of N=oo (infinity). As the diagram above attempts to illustrate, that makes for a situation in which "true" and "false" are instrumentally, observationally, and therefore "logically" equivalent. Note that the same would be true for Cantor's Diagonal Slash, but more successfully, as a proof of a finite number of numbers in a given interval would be possible in a finite proof, but fails to materialize in a finite number of steps.