Hypersequent
   HOME

TheInfoList



OR:

In
mathematical logic Mathematical logic is the study of formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic commonly addresses the mathematical properties of formal ...
, the hypersequent framework is an extension of the proof-theoretical framework of sequent calculi used in
structural proof theory In mathematical logic, structural proof theory is the subdiscipline of proof theory that studies proof calculi that support a notion of analytic proof, a kind of proof whose semantic properties are exposed. When all the theorems of a logic formal ...
to provide analytic calculi for logics that are not captured in the sequent framework. A hypersequent is usually taken to be a finite
multiset In mathematics, a multiset (or bag, or mset) is a modification of the concept of a set that, unlike a set, allows for multiple instances for each of its elements. The number of instances given for each element is called the multiplicity of that ...
of ordinary
sequent 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 ass ...
s, written : \Gamma_1 \Rightarrow \Delta_1 \mid \cdots \mid \Gamma_n \Rightarrow \Delta_n The sequents making up a hypersequent are called components. The added expressivity of the hypersequent framework is provided by rules manipulating different components, such as the communication rule for the
intermediate logic In mathematical logic, a superintuitionistic logic is a propositional logic extending intuitionistic logic. Classical logic is the strongest consistent superintuitionistic logic; thus, consistent superintuitionistic logics are called intermediate ...
LC (below left) or the modal splitting rule for modal logic S5 (below right): : \frac \frac Hypersequent calculi have been used to treat modal logics,
intermediate logics In mathematical logic, a superintuitionistic logic is a propositional logic extending intuitionistic logic. Classical logic is the strongest consistent superintuitionistic logic; thus, consistent superintuitionistic logics are called intermedia ...
, and
substructural logics In logic, a substructural logic is a logic lacking one of the usual structural rules (e.g. of classical and intuitionistic logic), such as weakening, contraction, exchange or associativity. Two of the more significant substructural logics are ...
. Hypersequents usually have a formula interpretation, i.e., are interpreted by a formula in the object language, nearly always as some kind of disjunction. The precise formula interpretation depends on the considered logic.


Formal definitions and propositional rules

Formally, a hypersequent is usually taken to be a finite
multiset In mathematics, a multiset (or bag, or mset) is a modification of the concept of a set that, unlike a set, allows for multiple instances for each of its elements. The number of instances given for each element is called the multiplicity of that ...
of ordinary
sequent 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 ass ...
s, written : \Gamma_1 \Rightarrow \Delta_1 \mid \dots \mid \Gamma_n \Rightarrow \Delta_n The sequents making up a hypersequent consist of tuples of multisets of formulae, and are called the components of the hypersequent. Variants defining hypersequents and sequents in terms of sets or lists instead of multisets are also considered, and depending on the considered logic the sequents can be classical or intuitionistic. The rules for the propositional connectives usually are adaptions of the corresponding standard sequent rules with an additional side hypersequent, also called hypersequent context. E.g., a common set of rules for the
functionally complete In logic, a functionally complete set of logical connectives or Boolean operators is one which can be used to express all possible truth tables by combining members of the set into a Boolean expression.. ("Complete set of logical connectives").. (" ...
set of connectives \ for
classical propositional logic Propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. It deals with propositions (which can be true or false) and relations b ...
is given by the following four rules: : \frac : \frac : \frac \frac Due to the additional structure in the hypersequent setting the
structural rule In proof theory, a structural rule is an inference rule that does not refer to any logical connective, but instead operates on the judgment or sequents directly. Structural rules often mimic intended meta-theoretic properties of the logic. Logic ...
s are considered in their internal and external variants. The internal weakening and internal contraction rules are the adaptions of the corresponding sequent rules with an added hypersequent context: : \frac \frac \frac The external weakening and external contraction rules are the corresponding rules on the level of hypersequent components instead of formulae: \frac \frac Soundness of these rules is closely connected to the formula interpretation of the hypersequent structure, nearly always as some form of
disjunction In logic, disjunction is a logical connective typically notated as \lor and read aloud as "or". For instance, the English language sentence "it is raining or it is snowing" can be represented in logic using the disjunctive formula R \lor ...
. The precise formula interpretation depends on the considered logic, see below for some examples.


Main examples


Modal logics

Hypersequents have been used to obtain analytic calculi for modal logics, for which analytic sequent calculi proved elusive. In the context of modal logics the standard formula interpretation of a hypersequent : \Gamma_1 \Rightarrow \Delta_1 \mid \dots \mid \Gamma_n \Rightarrow \Delta_n is the formula : \Box (\bigwedge \Gamma_1 \to \bigvee \Delta_1) \lor \dots \lor \Box( \bigwedge\Gamma_n \to \bigvee\Delta_n) Here if \Gamma is the multiset A_1, \dots, A_n we write \Box \Gamma for the result of prefixing every formula in \Gamma with \Box, i.e., the multiset \Box A_1, \dots, \Box A_n. Note that the single components are interpreted using the standard formula interpretation for sequents, and the hypersequent bar \mid is interpreted as a disjunction of boxes. The prime example of a modal logic for which hypersequents provide an analytic calculus is the logic S5. In a standard hypersequent calculus for this logic the formula interpretation is as above, and the propositional and structural rules are the ones from the previous section. Additionally, the calculus contains the modal rules : \frac \frac \frac
Admissibility Admissibility may refer to: Law * Admissible evidence, evidence which may be introduced in a court of law *Admissibility (ECHR), whether a case will be considered in the European Convention on Human Rights system Mathematics and logic * Admissible ...
of a suitably formulated version of the
cut rule In mathematical logic, the cut rule is an inference rule of sequent calculus. It is a generalisation of the classical modus ponens inference rule. Its meaning is that, if a formula ''A'' appears as a conclusion in one proof and a hypothesis in ...
can be shown by a syntactic argument on the structure of derivations or by showing completeness of the calculus without the cut rule directly using the semantics of S5. In line with the importance of modal logic S5, a number of alternative calculi have been formulated. Hypersequent calculi have also been proposed for many other modal logics.


Intermediate logics

Hypersequent calculi based on intuitionistic or single-succedent sequents have been used successfully to capture a large class of
intermediate logics In mathematical logic, a superintuitionistic logic is a propositional logic extending intuitionistic logic. Classical logic is the strongest consistent superintuitionistic logic; thus, consistent superintuitionistic logics are called intermedia ...
, i.e., extensions of
intuitionistic propositional logic In the philosophy of mathematics, intuitionism, or neointuitionism (opposed to preintuitionism), is an approach where mathematics is considered to be purely the result of the constructive mental activity of humans rather than the discovery of fu ...
. Since the hypersequents in this setting are based on single-succedent sequents, they have the following form: : \Gamma_1 \Rightarrow A_1 \mid \dots \mid \Gamma_n \Rightarrow A_n The standard formula interpretation for such an hypersequent is : (\bigwedge\Gamma_1 \to A_1) \lor \dots \lor (\bigwedge\Gamma_n \to A_n) Most hypersequent calculi for intermediate logics include the single-succedent versions of the propositional rules given above, a selection of the structural rules. The characteristics of a particular intermediate logic are mostly captured using a number of additional
structural rule In proof theory, a structural rule is an inference rule that does not refer to any logical connective, but instead operates on the judgment or sequents directly. Structural rules often mimic intended meta-theoretic properties of the logic. Logic ...
s. E.g., the standard calculus for intermediate logic LC, sometimes also called Gödel–Dummett logic, contains additionally the so-called communication rule: : \frac Hypersequent calculi for many other intermediate logics have been introduced, and there are very general results about
cut elimination The cut-elimination theorem (or Gentzen's ''Hauptsatz'') is the central result establishing the significance of the sequent calculus. It was originally proved by Gerhard Gentzen in his landmark 1934 paper "Investigations in Logical Deduction" for ...
in such calculi.


Substructural logics

As for intermediate logics, hypersequents have been used to obtain analytic calculi for many
substructural logics In logic, a substructural logic is a logic lacking one of the usual structural rules (e.g. of classical and intuitionistic logic), such as weakening, contraction, exchange or associativity. Two of the more significant substructural logics are ...
and
fuzzy logics Fuzzy logic is a form of many-valued logic in which the truth value of variables may be any real number between 0 and 1. It is employed to handle the concept of partial truth, where the truth value may range between completely true and completely ...
.{{Cite book, title=Proof theory for fuzzy logics, last1=Metcalfe, first1=George, last2=Olivetti, first2=Nicola, last3=Gabbay, first3=Dov, author3link = Dov Gabbay, publisher=Springer, Berlin, year=2008


History

The hypersequent structure seem to have appeared first in under the name of cortege to obtain a calculus for modal logic S5. It seems to have been developed independently in, also for treating modal logics, and in the influential, where calculi for modal, intermediate and substructural logics are considered, and the term hypersequent is introduced.


References

Proof theory