****Update
The Law of Non Contradiction Negates itself at the Meta-Level; Recursion Negates LNC
The Application of the LNC on LNC by degree of a recursive hierarchy results in LNC negating itself as the recursive hierarchy itself given LNC exists across the hierarchy resulting in a fixed point scale invariant state, between the identities that compose it thus resulting in the very same identities which compose LNC as not equalling themselves.
"=" identity equivalence
"=/=" identity non-equivalence
"<->" biconditional identity
A =/= -A
B =/= (A=/=-A)
((B=B), (B =/= -B))
((B =/= -B) = (A=/=-A)) = (C=/=-C)
((B = A), (-B = -A)) <-> (B =/= -B) = (A=/=-A)
((B =/= A), (B =/= -A)) <-> (B =/= (A=/=-A))
((B=A), ((B=/=A) = (B =/= B)))
****All standard formalism, rules, syntax and semantics are subject to LNC if they are to have identity, thus the meta-formalism is prior to such objects.