>>12572762This seems ambiguous for a logic question. If somethings are assumed to be biconditional, then manipulating either side is fine. If you are trying to prove somethings are biconditional, then reversing logic will be circular reasoning. Not totally invalid if the biconditional pair is discovered to be a tautology.
Suppose we are trying to prove (A<=>B)
Well, all statements can be satisfied and "proved" by an and operation with argument X, where X is a contradiction. AX = BX = 0. Don't think this is the best example as it is also pointing towards incomplete logical deduction and not only circular reasoning.
The ideal X candidate would be one where Given candidates P_n and logical operations L, For All P_n, X_n L P_N = 1 . This can be specifically generated for any statements usually through X having compliments of P_n and applying demorgans laws to sufficiently shuffle the contradiction into obscurity.
So, instead of:
AX = BX = 0
A better example would be:
A + X = B + X = 1.
