S

Sequent

Conditional assertion that if all of the antecedent conditions are true, then at least one of the consequent formulas is true

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").

Nº Q843632 ★

Common · Knowledge

Sequent

Conditional assertion that if all of the antecedent conditions are true, then at least one of the consequent formulas is true

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").

Last price

—

Floor price

—

7-day median

—

30-day sales

0

30-day range

—

In circulation

0

Price history

Show table
Datemedian LowHighsales

Sales history

Last sale
—
30-day average
—
30-day low
—
30-day high
—
Sales 7d
0
Sales 30d
0

No sales yet.

Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.

From Wikipedia

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.

Text: Wikipédia, CC BY-SA 4.0. ·

Related cards

View card

Confirmation