Sequent
In mathematical logic, a sequent is a very general kind of conditional assertion.
A
1
,
…
,
A
m
⊢
B
1
,
…
,
B
n
.
{\displaystyle 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.
Overdrive EP
- 2021-07-16T00:00:00.000000Z
Thread EP
- 2019-11-01T00:00:00.000000Z
3
- 2015-07-10T00:00:00.000000Z
Manipulated
- 2014-01-13T00:00:00.000000Z
Borrowed Time
- 2009-01-01T00:00:00.000000Z
Similar Artists