Odtnhj

In mathematical logic, a sequent is a very general kind of conditional assertion.

A1,…,Am⊢B1,…,Bn.displaystyle A_1,,dots ,A_m,vdash ,B_1,,dots ,B_n.

A sequent may have any number m of condition formulas A_i (called "antecedents") and any number n of asserted formulas B_j (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.

Introduction

The form and semantics of sequents

Sequents are best understood in the context of the following three kinds of logical judgments:

1. 
   Unconditional assertion. No antecedent formulas.
   
   • Example: ⊢ B
     
   
   
   • Meaning: B is true.
   
   


2. 
   Conditional assertion. Any number of antecedent formulas.
   
   1. 
      Simple conditional assertion. Single consequent formula.
      
      • Example: A₁, A₂, A₃ ⊢ B
        
      
      
      • Meaning: IF A₁ AND A₂ AND A₃ are true, THEN B is true.
      
      
   
   
   2. 
      Sequent. Any number of consequent formulas.
      
      • Example: A₁, A₂, A₃ ⊢ B₁, B₂, B₃, B₄
        
      
      
      • Meaning: IF A₁ AND A₂ AND A₃ are true, THEN B₁ OR B₂ OR B₃ OR B₄ is true.
      
      
   
   

Thus sequents are a generalization of simple conditional assertions, which are a generalization of unconditional assertions.

The word "OR" here is the inclusive OR.^[1] The motivation for disjunctive semantics on the right side of a sequent comes from three main benefits.

1. The symmetry of the classical inference rules for sequents with such semantics.


2. The ease and simplicity of converting such classical rules to intuitionistic rules.


3. The ability to prove completeness for predicate calculus when it is expressed in this way.

All three of these benefits were identified in the founding paper by Gentzen (1934, p. 194).

Not all authors have adhered to Gentzen's original meaning for the word "sequent". For example, Lemmon (1965) used the word "sequent" strictly for simple conditional assertions with one and only one consequent formula.^[2] The same single-consequent definition for a sequent is given by Huth & Ryan 2004, p. 5.

Syntax details

In a general sequent of the form

Γ⊢Σdisplaystyle Gamma vdash Sigma

both Γ and Σ are sequences of logical formulas, not sets. Therefore both the number and order of occurrences of formulas are significant. In particular, the same formula may appear twice in the same sequence. The full set of sequent calculus inference rules contains rules to swap adjacent formulas on the left and on the right of the assertion symbol (and thereby arbitrarily permute the left and right sequences), and also to insert arbitrary formulas and remove duplicate copies within the left and the right sequences. (However, Smullyan (1995, pp. 107–108), uses sets of formulas in sequents instead of sequences of formulas. Consequently the three pairs of structural rules called "thinning", "contraction" and "interchange" are not required.)

The symbol ' ⊢displaystyle vdash ' is often referred to as the "turnstile", "right tack", "tee", "assertion sign" or "assertion symbol". It is often read, suggestively, as "yields", "proves" or "entails".

Properties

Effects of inserting and removing propositions

Since every formula in the antecedent (the left side) must be true to conclude the truth of at least one formula in the succedent (the right side), adding formulas to either side results in a weaker sequent, while removing them from either side gives a stronger one. This is one of the symmetry advantages which follows from the use of disjunctive semantics on the right hand side of the assertion symbol, whereas conjunctive semantics is adhered to on the left hand side.

Consequences of empty lists of formulas

In the extreme case where the list of antecedent formulas of a sequent is empty, the consequent is unconditional. This differs from the simple unconditional assertion because the number of consequents is arbitrary, not necessarily a single consequent. Thus for example, ' ⊢ B₁, B₂ ' means that either B₁, or B₂, or both must be true. An empty antecedent formula list is equivalent to the "always true" proposition, called the "verum", denoted "⊤". (See Tee (symbol).)

In the extreme case where the list of consequent formulas of a sequent is empty, the rule is still that at least one term on the right be true, which is clearly impossible. This is signified by the 'always false' proposition, called the "falsum", denoted "⊥". Since the consequence is false, at least one of the antecedents must be false. Thus for example, ' A₁, A₂ ⊢ ' means that at least one of the antecedents A₁ and A₂ must be false.

One sees here again a symmetry because of the disjunctive semantics on the right hand side. If the left side is empty, then one or more right-side propositions must be true. If the right side is empty, then one or more of the left-side propositions must be false.

The doubly extreme case ' ⊢ ', where both the antecedent and consequent lists of formulas are empty is "not satisfiable".^[3] In this case, the meaning of the sequent is effectively ' ⊤ ⊢ ⊥ '. This is equivalent to the sequent ' ⊢ ⊥ ', which clearly cannot be valid.

Examples

A sequent of the form ' ⊢ α, β ', for logical formulas α and β, means that either α is true or β is true. But it does not mean that either α is a tautology or β is a tautology. To clarify this, consider the example ' ⊢ B ∨ A, C ∨ ¬A '. This is a valid sequent because either B ∨ A is true or C ∨ ¬A is true. But neither of these expressions is a tautology in isolation. It is the disjunction of these two expressions which is a tautology.

Similarly, a sequent of the form ' α, β ⊢ ', for logical formulas α and β, means that either α is false or β is false. But it does not mean that either α is a contradiction or β is a contradiction. To clarify this, consider the example ' B ∧ A, C ∧ ¬A ⊢ '. This is a valid sequent because either B ∧ A is false or C ∧ ¬A is false. But neither of these expressions is a contradiction in isolation. It is the conjunction of these two expressions which is a contradiction.

Rules

Most proof systems provide ways to deduce one sequent from another. These inference rules are written with a list of sequents above and below a line. This rule indicates that if everything above the line is true, so is everything under the line.

A typical rule is:

Γ,α⊢ΣΓ⊢αΓ⊢Σdisplaystyle frac Gamma ,alpha vdash Sigma qquad Gamma vdash alpha Gamma vdash Sigma

This indicates that if we can deduce that Γ,αdisplaystyle Gamma ,alpha yields Σdisplaystyle Sigma , and that Γdisplaystyle Gamma yields αdisplaystyle alpha , then we can also deduce that Γdisplaystyle Gamma yields Σdisplaystyle Sigma . (See also the full set of sequent calculus inference rules.)

Interpretation

History of the meaning of sequent assertions

The assertion symbol in sequents originally meant exactly the same as the implication operator. But over time, its meaning has changed to signify provability within a theory rather than semantic truth in all models.

In 1934, Gentzen did not define the assertion symbol ' ⊢ ' in a sequent to signify provability. He defined it to mean exactly the same as the implication operator ' ⇒ '. Using ' → ' instead of ' ⊢ ' and ' ⊃ ' instead of ' ⇒ ', he wrote: "The sequent A₁, ..., A_μ → B₁, ..., B_ν signifies, as regards content, exactly the same as the formula (A₁ & ... & A_μ) ⊃ (B₁ ∨ ... ∨ B_ν)".^[4] (Gentzen employed the right-arrow symbol between the antecedents and consequents of sequents. He employed the symbol ' ⊃ ' for the logical implication operator.)

In 1939, Hilbert and Bernays stated likewise that a sequent has the same meaning as the corresponding implication formula.^[5]

In 1944, Alonzo Church emphasized that Gentzen's sequent assertions did not signify provability.

"Employment of the deduction theorem as primitive or derived rule must not, however, be confused with the use of Sequenzen by Gentzen. For Gentzen's arrow, →, is not comparable to our syntactical notation, ⊢, but belongs to his object language (as is clear from the fact that expressions containing it appear as premisses and conclusions in applications of his rules of inference)."^[6]

Numerous publications after this time have stated that the assertion symbol in sequents does signify provability within the theory where the sequents are formulated. Curry in 1963,^[7]Lemmon in 1965,^[2] and Huth and Ryan in 2004^[8] all state that the sequent assertion symbol signifies provability. However, Ben-Ari (2012, p. 69) states that the assertion symbol in Gentzen-system sequents, which he denotes as ' ⇒ ', is part of the object language, not the metalanguage.^[9]

According to Prawitz (1965): "The calculi of sequents can be understood as meta-calculi for the deducibility relation in the corresponding systems of natural deduction."^[10] And furthermore: "A proof in a calculus of sequents can be looked upon as an instruction on how to construct a corresponding natural deduction."^[11] In other words, the assertion symbol is part of the object language for the sequent calculus, which is a kind of meta-calculus, but simultaneously signifies deducibility in an underlying natural deduction system.

Intuitive meaning

A sequent is a formalized statement of provability that is frequently used when specifying calculi for deduction. In the sequent calculus, the name sequent is used for the construct, which can be regarded as a specific kind of judgment, characteristic to this deduction system.

The intuitive meaning of the sequent Γ⊢Σdisplaystyle Gamma vdash Sigma is that under the assumption of Γ the conclusion of Σ is provable. Classically, the formulae on the left of the turnstile can be interpreted conjunctively while the formulae on the right can be considered as a disjunction. This means that, when all formulae in Γ hold, then at least one formula in Σ also has to be true. If the succedent is empty, this is interpreted as falsity, i.e. Γ⊢displaystyle Gamma vdash means that Γ proves falsity and is thus inconsistent. On the other hand an empty antecedent is assumed to be true, i.e., ⊢Σdisplaystyle vdash Sigma means that Σ follows without any assumptions, i.e., it is always true (as a disjunction). A sequent of this form, with Γ empty, is known as a logical assertion.

Of course, other intuitive explanations are possible, which are classically equivalent. For example, Γ⊢Σdisplaystyle Gamma vdash Sigma can be read as asserting that it cannot be the case that every formula in Γ is true and every formula in Σ is false (this is related to the double-negation interpretations of classical intuitionistic logic, such as Glivenko's theorem).

In any case, these intuitive readings are only pedagogical. Since formal proofs in proof theory are purely syntactic, the meaning of (the derivation of) a sequent is only given by the properties of the calculus that provides the actual rules of inference.

Barring any contradictions in the technically precise definition above we can describe sequents in their introductory logical form. Γdisplaystyle Gamma represents a set of assumptions that we begin our logical process with, for example "Socrates is a man" and "All men are mortal". The Σdisplaystyle Sigma represents a logical conclusion that follows under these premises. For example "Socrates is mortal" follows from a reasonable formalization of the above points and we could expect to see it on the Σdisplaystyle Sigma side of the turnstile. In this sense, ⊢displaystyle vdash means the process of reasoning, or "therefore" in English.

Variations

The general notion of sequent introduced here can be specialized in various ways. A sequent is said to be an intuitionistic sequent if there is at most one formula in the succedent (although multi-succedent calculi for intuitionistic logic are also possible). More precisely, the restriction of the general sequent calculus to single-succedent-formula sequents, with the same inference rules as for general sequents, constitutes an intuitionistic sequent calculus. (This restricted sequent calculus is denoted LJ.)

Similarly, one can obtain calculi for dual-intuitionistic logic (a type of paraconsistent logic) by requiring that sequents be singular in the antecedent.

In many cases, sequents are also assumed to consist of multisets or sets instead of sequences. Thus one disregards the order or even the numbers of occurrences of the formulae. For classical propositional logic this does not yield a problem, since the conclusions that one can draw from a collection of premises do not depend on these data. In substructural logic, however, this may become quite important.

Natural deduction systems use single-consequence conditional assertions, but they typically do not use the same sets of inference rules as Gentzen introduced in 1934. In particular, tabular natural deduction systems, which are very convenient for practical theorem-proving in propositional calculus and predicate calculus, were applied by Suppes (1957) and Lemmon (1965) for teaching introductory logic in textbooks.

Etymology

Historically, sequents have been introduced by Gerhard Gentzen in order to specify his famous sequent calculus.^[12] In his German publication he used the word "Sequenz". However, in English, the word "sequence" is already used as a translation to the German "Folge" and appears quite frequently in mathematics. The term "sequent" then has been created in search for an alternative translation of the German expression.

Kleene^[13] makes the following comment on the translation into English: "Gentzen says 'Sequenz', which we translate as 'sequent', because we have already used 'sequence' for any succession of objects, where the German is 'Folge'."

See also

• Gerhard Gentzen


• Intuitionistic logic


• Natural deduction


• Sequent calculus

Notes

References

• 
  Ben-Ari, Mordechai (2012) [1993]. Mathematical logic for computer science. London: Springer. ISBN 978-1-4471-4128-0..mw-parser-output cite.citationfont-style:inherit.mw-parser-output qquotes:"""""""'""'".mw-parser-output code.cs1-codecolor:inherit;background:inherit;border:inherit;padding:inherit.mw-parser-output .cs1-lock-free abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center.mw-parser-output .cs1-lock-limited a,.mw-parser-output .cs1-lock-registration abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center.mw-parser-output .cs1-lock-subscription abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registrationcolor:#555.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration spanborder-bottom:1px dotted;cursor:help.mw-parser-output .cs1-hidden-errordisplay:none;font-size:100%.mw-parser-output .cs1-visible-errorfont-size:100%.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-formatfont-size:95%.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-leftpadding-left:0.2em.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-rightpadding-right:0.2em
  


• 
  Church, Alonzo (1996) [1944]. Introduction to mathematical logic. Princeton, New Jersey: Princeton University Press. ISBN 978-0-691-02906-1.
  


• 
  Curry, Haskell Brooks (1977) [1963]. Foundations of mathematical logic. New York: Dover Publications Inc. ISBN 978-0-486-63462-3.
  


• 
  Gentzen, Gerhard (1934). "Untersuchungen über das logische Schließen. I". Mathematische Zeitschrift. 39 (2): 176–210. doi:10.1007/bf01201353.
  


• 
  Gentzen, Gerhard (1935). "Untersuchungen über das logische Schließen. II". Mathematische Zeitschrift. 39 (3): 405–431. doi:10.1007/bf01201363.
  


• 
  Hilbert, David; Bernays, Paul (1970) [1939]. Grundlagen der Mathematik II (Second ed.). Berlin, New York: Springer-Verlag. ISBN 978-3-642-86897-9.
  


• 
  Huth, Michael; Ryan, Mark (2004). Logic in Computer Science (Second ed.). Cambridge, United Kingdom: Cambridge University Press. ISBN 978-0-521-54310-1.
  


• 
  Kleene, Stephen Cole (2009) [1952]. Introduction to metamathematics. Ishi Press International. ISBN 978-0-923891-57-2.
  


• 
  Kleene, Stephen Cole (2002) [1967]. Mathematical logic. Mineola, New York: Dover Publications. ISBN 978-0-486-42533-7.
  


• 
  Lemmon, Edward John (1965). Beginning logic. Thomas Nelson. ISBN 0-17-712040-1.
  


• 
  Prawitz, Dag (2006) [1965]. Natural deduction: A proof-theoretical study. Mineola, New York: Dover Publications. ISBN 978-0-486-44655-4.
  


• 
  Smullyan, Raymond Merrill (1995) [1968]. First-order logic. New York: Dover Publications. ISBN 978-0-486-68370-6.
  


• 
  Suppes, Patrick Colonel (1999) [1957]. Introduction to logic. Mineola, New York: Dover Publications. ISBN 978-0-486-40687-9.
  


• 
  Takeuti, Gaisi (2013) [1975]. Proof theory (Second ed.). Mineola, New York: Dover Publications. ISBN 978-0-486-49073-1.
  

External links

• 
  Hazewinkel, Michiel, ed. (2001) [1994], "Sequent (in logic)", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4