In mathematical logic, a sequent is a very general kind of conditional assertion.
In mathematical logic, a sequent is a very general kind of conditional assertion. A_1,\,\dots,A_m \,\vdash\, B_1,\,\dots,B_n.
A sequent may have any number m of condition formulas Ai (called "antecedents") and any number n of asserted formulas Bj (called "succedents" or "consequents"). A sequent is understood to mean that if all of the antecedent conditions are true, then at least one of the consequent formulas is true. This style of conditional assertion is almost always associated with the conceptual framework of sequent calculus.
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).