GaeBlogX Arista Networks, Software-Defined Networking

# Sequent Calculus

2018-02-18
Yanxi Chen

## Verifications

$A\uparrow$ means $A$ has a verification.

$A\downarrow$ means $A$ ay be used

A conversion rule ($\downarrow\uparrow$):

where $P$ is atomic

### Conjunctions

Introduction rule ($I$):

Elimination rules ($E$):

### Implications

Introduction rule ($I^x$):

Elimination rules ($E$):

### Disjunctions

Introduction rule ($I$):

Elimination rules ($E$):

Note: We can’t use elimination right after introduction, becasue the arrows don’t match

## Sequents

So for natural deduction, we have elimination rules and introduction rules. For sequent calculus, we have left rules and right rules, where left rules are just the inverse of the elimination rules, and right rules are just the same as introduction rules.

The reasoning behind it is that elimination rules always produce down arrows, and introduction rules always produce up arrows. If we use natural deduction, we will kind of need to work on two directions, and when they meet, we stop and use the conversion rule ($\downarrow\uparrow$).

To simplify things, we reverse the elimination rules so that it is also pointing upward, so that we will only need to work in one direction. And we stop at something called identity rule.

Basically everything with $uparrow$ should be on the right of $\Rightarrow$, and vice versa.

We use the following notation:

Identity rule:

Right rules:

Left rules:

Right rules:

Left rules:

Right rules:

Left rules:

Right rules:

Left rules: