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 formalised in a structural proof theory have analytic proofs, then the proof theory can be used to demonstrate such things as consistency, provide decision procedures, and allow mathematical or computational witnesses to be extracted as counterparts to theorems, the kind of task that is more often given to model theory.[1]

## Analytic proof

[edit]

Main article: Analytic proof

The notion of analytic proof was introduced into proof theory by Gerhard Gentzen for the sequent calculus; the analytic proofs are those that are cut-free. His natural deduction calculus also supports a notion of analytic proof, as was shown by Dag Prawitz; the definition is slightly more complex--the analytic proofs are the normal forms, which are related to the notion of normal form in term rewriting.

## Structures and connectives

[edit]

The term structure in structural proof theory comes from a technical notion introduced in the sequent calculus: the sequent calculus represents the judgement made at any stage of an inference using special, extra-logical operators called structural operators: in  A 1 , … , A m ⊢ B 1 , … , B n {\displaystyle A_{1},\dots ,A_{m}\vdash B_{1},\dots ,B_{n}} , the commas to the left of the turnstile are operators normally interpreted as conjunctions, those to the right as disjunctions, whilst the turnstile symbol itself is interpreted as an implication. However, it is important to note that there is a fundamental difference in behaviour between these operators and the logical connectives they are interpreted by in the sequent calculus: the structural operators are used in every rule of the calculus, and are not considered when asking whether the subformula property applies. Furthermore, the logical rules go one way only: logical structure is introduced by logical rules, and cannot be eliminated once created, while structural operators can be introduced and eliminated in the course of a derivation.

The idea of looking at the syntactic features of sequents as special, non-logical operators is not old, and was forced by innovations in proof theory: when the structural operators are as simple as in Getzen's original sequent calculus there is little need to analyse them, but proof calculi of deep inference such as display logic (introduced by Nuel Belnap in 1982)[2] support structural operators as complex as the logical connectives, and demand sophisticated treatment.

## Cut-elimination in the sequent calculus

[edit]

Main article: Cut-elimination

This section needs expansion. You can help by adding to it. (December 2009)

|

## Natural deduction and the formulae-as-types correspondence

[edit]

Main article: Natural deduction

This section needs expansion. You can help by adding to it. (December 2009)

|

## Logical duality and harmony

[edit]

Main article: Logical harmony

This section needs expansion. You can help by adding to it. (December 2009)

|

## Hypersequents

[edit]

Main article: Hypersequent

The hypersequent framework extends the ordinary sequent structure to a multiset of sequents, using an additional structural connective | (called the hypersequent bar) to separate different sequents. It has been used to provide analytic calculi for, e.g., modal, intermediate and substructural logics[3][4][5] A hypersequent is a structure

Γ 1 ⊢ Δ 1 ∣ ⋯ ∣ Γ n ⊢ Δ n {\displaystyle \Gamma _{1}\vdash \Delta _{1}\mid \dots \mid \Gamma _{n}\vdash \Delta _{n}}

where each  Γ i ⊢ Δ i {\displaystyle \Gamma _{i}\vdash \Delta _{i}} is an ordinary sequent, called a component of the hypersequent. As for sequents, hypersequents can be based on sets, multisets, or sequences, and the components can be single-conclusion or multi-conclusion sequents. The formula interpretation of the hypersequents depends on the logic under consideration, but is nearly always some form of disjunction. The most common interpretations are as a simple disjunction

( ⋀ Γ 1 -> ⋁ Δ 1 ) ∨ ⋯ ∨ ( ⋀ Γ n -> ⋁ Δ n ) {\displaystyle (\bigwedge \Gamma _{1}\rightarrow \bigvee \Delta _{1})\lor \dots \lor (\bigwedge \Gamma _{n}\rightarrow \bigvee \Delta _{n})}

for intermediate logics, or as a disjunction of boxes

◻ ( ⋀ Γ 1 -> ⋁ Δ 1 ) ∨ ⋯ ∨ ◻ ( ⋀ Γ n -> ⋁ Δ n ) {\displaystyle \Box (\bigwedge \Gamma _{1}\rightarrow \bigvee \Delta _{1})\lor \dots \lor \Box (\bigwedge \Gamma _{n}\rightarrow \bigvee \Delta _{n})}

for modal logics.

In line with the disjunctive interpretation of the hypersequent bar, essentially all hypersequent calculi include the external structural rules, in particular the external weakening rule

Γ 1 ⊢ Δ 1 ∣ ⋯ ∣ Γ n ⊢ Δ n Γ 1 ⊢ Δ 1 ∣ ⋯ ∣ Γ n ⊢ Δ n ∣ Σ ⊢ Π {\displaystyle {\frac {\Gamma _{1}\vdash \Delta _{1}\mid \dots \mid \Gamma _{n}\vdash \Delta _{n}}{\Gamma _{1}\vdash \Delta _{1}\mid \dots \mid \Gamma _{n}\vdash \Delta _{n}\mid \Sigma \vdash \Pi }}}

and the external contraction rule

Γ 1 ⊢ Δ 1 ∣ ⋯ ∣ Γ n ⊢ Δ n ∣ Γ n ⊢ Δ n Γ 1 ⊢ Δ 1 ∣ ⋯ ∣ Γ n ⊢ Δ n {\displaystyle {\frac {\Gamma _{1}\vdash \Delta _{1}\mid \dots \mid \Gamma _{n}\vdash \Delta _{n}\mid \Gamma _{n}\vdash \Delta _{n}}{\Gamma _{1}\vdash \Delta _{1}\mid \dots \mid \Gamma _{n}\vdash \Delta _{n}}}}

The additional expressivity of the hypersequent framework is provided by rules manipulating the hypersequent structure. An important example is provided by the modalised splitting rule[4]

Γ 1 ⊢ Δ 1 ∣ ⋯ ∣ Γ n ⊢ Δ n ∣ ◻ Σ , Ω ⊢ ◻ Π , Θ Γ 1 ⊢ Δ 1 ∣ ⋯ ∣ Γ n ⊢ Δ n ∣ ◻ Σ ⊢ ◻ Π ∣ Ω ⊢ Θ {\displaystyle {\frac {\Gamma _{1}\vdash \Delta _{1}\mid \dots \mid \Gamma _{n}\vdash \Delta _{n}\mid \Box \Sigma ,\Omega \vdash \Box \Pi ,\Theta }{\Gamma _{1}\vdash \Delta _{1}\mid \dots \mid \Gamma _{n}\vdash \Delta _{n}\mid \Box \Sigma \vdash \Box \Pi \mid \Omega \vdash \Theta }}}

for modal logic S5, where  ◻ Σ {\displaystyle \Box \Sigma } means that every formula in  ◻ Σ {\displaystyle \Box \Sigma } is of the form  ◻ A {\displaystyle \Box A} .

Another example is given by the communication rule for the intermediate logic LC[4]

Γ 1 ⊢ Δ 1 ∣ ⋯ ∣ Γ n ⊢ Δ n ∣ Ω ⊢ A Σ 1 ⊢ Π 1 ∣ ⋯ ∣ Σ m ⊢ Π m ∣ Θ ⊢ B Γ 1 ⊢ Δ 1 ∣ ⋯ ∣ Γ n ⊢ Δ n ∣ Σ 1 ⊢ Π 1 ∣ ⋯ ∣ Σ m ⊢ Π m ∣ Ω ⊢ B ∣ Θ ⊢ A {\displaystyle {\frac {\Gamma _{1}\vdash \Delta _{1}\mid \dots \mid \Gamma _{n}\vdash \Delta _{n}\mid \Omega \vdash A\qquad \Sigma _{1}\vdash \Pi _{1}\mid \dots \mid \Sigma _{m}\vdash \Pi _{m}\mid \Theta \vdash B}{\Gamma _{1}\vdash \Delta _{1}\mid \dots \mid \Gamma _{n}\vdash \Delta _{n}\mid \Sigma _{1}\vdash \Pi _{1}\mid \dots \mid \Sigma _{m}\vdash \Pi _{m}\mid \Omega \vdash B\mid \Theta \vdash A}}}

Note that in the communication rule the components are single-conclusion sequents.

## Calculus of structures

[edit]

Main article: Calculus of structures

This section needs expansion. You can help by adding to it. (December 2009)

|

## Nested sequent calculus

[edit]

Main article: Nested sequent calculus

The nested sequent calculus is a formalisation that resembles a 2-sided calculus of structures.

## Notes

[edit]

1. ^ "Structural Proof Theory". www.philpapers.org. Retrieved 2024-08-18.
2. ^ N. D. Belnap. "Display Logic." Journal of Philosophical Logic, 11(4), 375–417, 1982.
3. ^ Minc, G.E. (1971) [Originally published in Russian in 1968]. "On some calculi of modal logic". The Calculi of Symbolic Logic. Proceedings of the Steklov Institute of Mathematics. 98. AMS: 97–124.
4. ^ a b c Avron, Arnon (1996). "The method of hypersequents in the proof theory of propositional non-classical logics" (PDF). Logic: From Foundations to Applications: European Logic Colloquium. Clarendon Press: 1–32.
5. ^ Pottinger, Garrel (1983). "Uniform, cut-free formulations of T, S4, and S5". Journal of Symbolic Logic. 48 (3): 900. doi:10.2307/2273495. JSTOR 2273495. S2CID 250346853.

## References

[edit]

* Sara Negri; Jan Von Plato (2001). Structural proof theory. Cambridge University Press. ISBN 978-0-521-79307-0.
* Anne Sjerp Troelstra; Helmut Schwichtenberg (2000). Basic proof theory (2nd ed.). Cambridge University Press. ISBN 978-0-521-77911-1.