equivalent(f, g) -- whether two formulas agree on every assignment of their free names as booleans (F_0322, LT L_0079).
Logical equivalence is not ==.== compares values and stays what it was (f == g between two formulas echoes itself, and a connective is not even an operand of ==, L_0066); equivalence asks about every row of the table, which is what the BL lessons built by hand as truth f xor g reading false throughout.
Both sides are evaluated first, so a name bound in the session is read as its value and is not enumerated; the names left over -- the free names of the two reduced sides together -- are enumerated as truth does, the first name the most significant. true when every row agrees, false as soon as one differs (the first such row is in detailed, for the REPL's note), and unevaluated past the table's cap or when a row is no boolean: crisp only, the cnf / dnf convention (F_0133), since a graded value has no row to be equal on.