1 minute read

VerificationsPermalink

A means A has a verification.

A means A ay be used

A conversion rule (↓↑):

PP

where P is atomic

ConjunctionsPermalink

Introduction rule (I):

A,BAB

Elimination rules (E):

ABA ABB

ImplicationsPermalink

Introduction rule (Ix):

A¯x BAB

Elimination rules (E):

ABAB

DisjunctionsPermalink

Introduction rule (I):

AAB BAB

Elimination rules (E):

AB,A¯x C,B¯y CC

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

SequentsPermalink

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 (↓↑).

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 , and vice versa.

We use the following notation:

B1,,BnA

Identity rule:

P,PP

ConjunctionsPermalink

Right rules:

ΓA,ΓbΓAB

Left rules:

Γ,AB,ACΓ,ABC Γ,AB,CCΓ,ABC

ImplicationsPermalink

Right rules:

Γ,ABΓAB

Left rules:

Γ,ABA   Γ,AB,BCΓ,ABC

DisjunctionsPermalink

Right rules:

ΓAΓAB ΓBΓAB

Left rules:

Γ,AB,AC   Γ,AB,BCΓ,ABC

FalsehoodPermalink

Right rules:

no R

Left rules:

Γ,⊥⇒C

Comments