Episode 15

Cirquent calculus
• About cirquent calculus in general
• The language of CL5
• Cirquents
• Cirquents as circuits
• Formulas as cirquents
• Operations on cirquents
• The rules of inference of CL5
• The soundness and completeness of CL5
• A cirquent calculus system for classical logic
• CL5 versus affine logic
0
15.1 About cirquent calculus in general

Cirquent calculus is a new proof-theoretic approach, introduced

recently in “Introduction to cirquent calculus and abstract resource
semantics”. Its invention was motivated by the needs of computability
logic, which had stubbornly resisted any axiomatization attempts within
the framework of the traditional proof-theoretic approaches such as
sequent calculus or Hilbert-style systems.

The main distinguishing feature of cirquent calculus from the known

approaches is sharing: it allows us to account for the possibility of shared
resources (say, formulas) between different parts of a proof tree.

The version of cirquent calculus presented here can be called shallow

as it limits cirquents to depth 2. Deep versions of cirquent calculus, with
no such limits, are being currently developed.
15.2 The language of CL5

The cirquent calculus system that we consider here is called CL5.

CL5 axiomatizes the fragment of computability logic where all letters
are general and 0-ary. And the only logical operators are ,  and .
Furthermore, as in systems G1, G2 and G3 (Episodes 4 and 5),  is
only allowed on atoms (if this condition is not satisfied, the formula
should be rewritten into an equivalent one using the double negation and
DeMorgan’s principles). And FG is understood as an abbreviation of
EF.
We agree that, throughout this episode, “formula” exclusively means
a formula of the above fragment of the language of computability logic.
CL5 has 7 rules of inference: Identity, Mix, Exchange, Weakening,
Duplication, -Introduction and -Introduction. We present those rules,
as well as the concept of a cirquent, very informally through examples
and illustrations. More formal definitions, if needed, can be found in
“Introduction to cirquent calculus and abstract resource semantics”.
15.3
Cirquents
F G H F Formulas
Arcs
Groups

Every formula should be in (= connected with an arc to) at least one group.
15.4
Formulas as Cirquents

F
F =
15.4
Cirquents as Circuits
F G H F
Circuit Sequent
15.4
Cirquents as Circuits
F G H F
Cir quent
15.4
Cirquents as Circuits
F G H F
Cir quent
15.4
Cirquents as Circuits
F G H F
Cir quent
sequent sequent sequent

F G H F
Circuit

  


15.5
Operations on Cirquents
F G H F

Merging groups (merging groups #1 and #2):

F G H F
15.5
Operations on Cirquents
F G H F

Merging groups (merging groups #1 and #2):

F G H F
15.5
Operations on Cirquents
F G H F

Merging groups (merging groups #1 and #2):

F G H F
15.5
Operations on Cirquents
F G H F

Merging groups (merging groups #1 and #2):

F G H F
15.5
Operations on Cirquents
F G H F

Merging groups (merging groups #1 and #2):

F G H F
15.5
Operations on Cirquents
F G H F

Merging groups (merging groups #1 and #2):

F G H F
15.5
Operations on Cirquents
F G H F

Merging groups (merging groups #1 and #2):

F G H F
15.5
Operations on Cirquents
F G H F

Merging groups (merging groups #1 and #2):

F G H F

Merging formulas (merging G and H into E):

F G H F
15.5
Operations on Cirquents
F G H F

Merging groups (merging groups #1 and #2):

F G H F

Merging formulas (merging G and H into E):

F G H F
15.5
Operations on Cirquents
F G H F

Merging groups (merging groups #1 and #2):

F G H F

Merging formulas (merging G and H into E):

F G H F
15.5
Operations on Cirquents
F G H F

Merging groups (merging groups #1 and #2):

F G H F

Merging formulas (merging G and H into E):

F G H F
15.5
Operations on Cirquents
F G H F

Merging groups (merging groups #1 and #2):

F G H F

Merging formulas (merging G and H into E):

F G H F
15.5
Operations on Cirquents
F G H F

Merging groups (merging groups #1 and #2):

F G H F

Merging formulas (merging G and H into E):

F G H F
15.5
Operations on Cirquents
F G H F

Merging groups (merging groups #1 and #2):

F G H F

Merging formulas (merging G and H into E):

F GH F
15.5
Operations on Cirquents
F G H F

Merging groups (merging groups #1 and #2):

F G H F

Merging formulas (merging G and H into E):

F E F
15.6
Identity

I
F F
15.7
Mix

F F G G

Put one cirquent next to the other

15.7
Mix

F F G G

M
F F G G

Put one cirquent next to the other

15.7
Mix

F F G G

M
F F G G

Put one cirquent next to the other

15.7
Mix

F F G G

M
F F G G

Put one cirquent next to the other

15.7
Mix

F F G G

M
F F G G

Put one cirquent next to the other

15.7
Mix

F F G G

M
F F G G

Put one cirquent next to the other

15.8
Exchange
F F G G

Swap two adjacent formulas or groups

15.8
Exchange
F F G G

E
F F G G

Swap two adjacent formulas or groups

15.8
Exchange
F F G G

E
F F G G

Swap two adjacent formulas or groups

15.8
Exchange
F F G G

E
F F GG

Swap two adjacent formulas or groups

15.8
Exchange
F F G G

E
F F G G

Swap two adjacent formulas or groups

15.8
Exchange
F F G G

E
F F G G

E
F F G G

Swap two adjacent formulas or groups

15.8
Exchange
F F G G

E
F F G G

E
F F G G

Swap two adjacent formulas or groups

15.8
Exchange
F F G G

E
F F G G

E
F GF G

Swap two adjacent formulas or groups

15.8
Exchange
F F G G

E
F F G G

E
F G F G

Swap two adjacent formulas or groups

15.8
Exchange
F F G G

E
F F G G

E
F G F G

E
F G F G

Swap two adjacent formulas or groups

15.8
Exchange
F F G G

E
F F G G

E
F G F G

E
F G F G

Swap two adjacent formulas or groups

15.8
Exchange
F F G G

E
F F G G

E
F G F G

E
F G F G

Swap two adjacent formulas or groups

15.8
Exchange
F F G G

E
F F G G

E
F G F G

E
F G F G

Swap two adjacent formulas or groups

15.8
Exchange
F F G G

E
F F G G

E
F G F G

E
F G F G

Swap two adjacent formulas or groups

15.9
Weakening

E F G H

W
E F G H

Delete any arc in any group of the conclusion;

if this leaves some formula “homeless”, delete that formula as well
15.9
Weakening

E F G H

W
E F G H

W
E F G H

Delete any arc in any group of the conclusion;

if this leaves some formula “homeless”, delete that formula as well
15.9
Weakening

E F G H

W
E F G H

W
E F G H

Delete any arc in any group of the conclusion;

if this leaves some formula “homeless”, delete that formula as well
15.10
Duplication

E F G H

Replace a group with two identical copies

15.10
Duplication

E F G H

D
E F G H

Replace a group with two identical copies

15.10
Duplication

E F G H

D
E F G H

Replace a group with two identical copies

15.10
Duplication

E F G H

D
E F G H

Replace a group with two identical copies

15.10
Duplication

E F G H

D
E F G H

Replace a group with two identical copies

15.11
-Introduction

E F G H

Merge two adjacent formulas F and G into FG

15.11
-Introduction

E F G H


E F G H

Merge two adjacent formulas F and G into FG

15.11
-Introduction

E F G H


E F G H

Merge two adjacent formulas F and G into FG

15.11
-Introduction

E F G H


E F G H

Merge two adjacent formulas F and G into FG

15.11
-Introduction

E F G H


E F G H

Merge two adjacent formulas F and G into FG

15.12
-Introduction
E F G H


E F G H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H


E F G H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H


E F G H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H


E F G H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H


E FG H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E FG H


E FG H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H


E FG H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H


E FG H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H


E FG H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H


E FG H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E FG H


E FG H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H


E FG H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H


E FG H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H


E FG H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H


E FG H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E FG H


E FG H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H


E FG H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H


E FG H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H


E FG H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H


E FG H

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H K


E F G H K

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H K


E F G H K

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H K


E F G H K

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H K


E F G H K

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H K


E F G H K

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H K


E F G H K

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H K


E F G H K

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H K


E F G H K

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H K


E F G H K

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H K


E F G H K

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H K


E F G H K

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H K


E F G H K

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H K


E F G H K

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.12
-Introduction
E F G H K


E F G H K

In the premise:
• F and G are adjacent formulas, and no group contains both of them together;
• Every group containing F is immediately followed by a group containing G, and vice
versa: every group containing G is immediately preceded by a group containing F.

To obtain the conclusion:

• Merge each group that contains F with its right neighbor (that contains G);
• Then merge F and G into FG.
15.13 Proof of Blass’s Principle

( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle

( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle


( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle

P  Q R  S (P  R )  (Q  S )


( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle

P  Q R  S (P  R )  (Q  S )


( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle

P  Q R  S (P  R )  (Q  S )


( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle

P  Q R  S (P  R )  (Q  S )


( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle


P  Q R  S (P  R )  (Q  S )


( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle

P  Q R  S P R QS


P  Q R  S (P  R )  (Q  S )


( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle

P  Q R  S P R QS


P  Q R  S (P  R )  (Q  S )


( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle

P  Q R  S P R QS


P  Q R  S (P  R )  (Q  S )


( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle

P  Q R  S P R QS


P  Q R  S (P  R )  (Q  S )


( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle


P  Q R  S P R QS


P  Q R  S (P  R )  (Q  S )


( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle


P  Q R  S P R QS


P  Q R  S (P  R )  (Q  S )


( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle

P Q R  S P R QS


P  Q R  S P R QS


P  Q R  S (P  R )  (Q  S )


( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle

P Q R  S P R QS


P  Q R  S P R QS


P  Q R  S (P  R )  (Q  S )


( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle

P Q R S P R QS


P  Q R  S P R QS


P  Q R  S (P  R )  (Q  S )


( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle

P Q R S P R QS


P  Q R  S P R QS


P  Q R  S (P  R )  (Q  S )


( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle

P Q R S P R Q S


P  Q R  S P R QS


P  Q R  S (P  R )  (Q  S )


( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.13 Proof of Blass’s Principle
I I I I
P P Q Q R R S S

M…M
P P Q Q R R S S

E…E
P Q R S P R Q S


P  Q R  S P R QS


P  Q R  S (P  R )  (Q  S )


( P  Q )  ( R  S ) (P  R )  (Q  S )


( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
15.14
Soundness and completeness

Theorem 15.1. For any formula F, the following statements are

equivalent:

(i) F is provable in CL5.

(ii) F is valid.
(iii) F is uniformly valid.

Furthermore, there is an effective procedure that takes a CL5-proof of

any formula F and constructs a uniform solution for F. We call this
property of CL5 (and the same property of any other deductive system)
uniform-constructive soundness.
15.15 CL5 versus classical logic
Remember that we see the atoms of classical logic as 0-ary elementary letters, while,
on the other hand, the atoms of CL5 are 0-ary general letters.
Let us for now disregard this difference and see no distinction between the two sorts
of atoms. That is, let us see the formulas of CL5 as formulas of propositional classical
logic. An interesting question to ask then is how CL5 compares with classical logic.
Here is an answer:

Fact 15.2. Every formula provable in CL5 is a tautology of classical logic, but not
vice versa: some tautologies are not provable in CL5 (and hence not valid in
computability logic when their atoms are seen as general atoms).

The simplest example of a tautology not provable in CL5 is P(PP).

Indeed, this formula (cirquent) could only be derived by -Introduction from the
premise
 P PP

With a little thought one can see that the above cirquent, in turn, cannot be derived.
15.16 A cirquent-calculus system for classical logic
The next question to ask is how to strengthen CL5 so that it proves all tautologies
(and only tautologies). The answer turns out to be very simple. All it takes to extend
CL5 to a sound and complete system for classical logic is to add to it the contraction
rule:
Contraction

E F F H

Merge two adjacent and identical formulas F and F into F

15.16 A cirquent-calculus system for classical logic
The next question to ask is how to strengthen CL5 so that it proves all tautologies
(and only tautologies). The answer turns out to be very simple. All it takes to extend
CL5 to a sound and complete system for classical logic is to add to it the contraction
rule:
Contraction

E F F H

C
E F F H

Merge two adjacent and identical formulas F and F into F

15.16 A cirquent-calculus system for classical logic
The next question to ask is how to strengthen CL5 so that it proves all tautologies
(and only tautologies). The answer turns out to be very simple. All it takes to extend
CL5 to a sound and complete system for classical logic is to add to it the contraction
rule:
Contraction

E F F H

C
E F F H

Merge two adjacent and identical formulas F and F into F

15.16 A cirquent-calculus system for classical logic
The next question to ask is how to strengthen CL5 so that it proves all tautologies
(and only tautologies). The answer turns out to be very simple. All it takes to extend
CL5 to a sound and complete system for classical logic is to add to it the contraction
rule:
Contraction

E F F H

C
E FF H

Merge two adjacent and identical formulas F and F into F

15.16 A cirquent-calculus system for classical logic
The next question to ask is how to strengthen CL5 so that it proves all tautologies
(and only tautologies). The answer turns out to be very simple. All it takes to extend
CL5 to a sound and complete system for classical logic is to add to it the contraction
rule:
Contraction

E F F H

C
E F H

Merge two adjacent and identical formulas F and F into F

15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P
15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P

M
P P P P
15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P

M
P P P P
15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P

M
P P P P
15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P

M
P P P P

E
P P P P
15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P

M
P P P P

E
P P
P P
15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P

M
P P P P

E
P P P P
15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P

M
P P P P

E
P P P P
15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P

M
P P P P

E
P P P P

C
P P P P
15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P

M
P P P P

E
P P P P

C
PP P P
15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P

M
P P P P

E
P P P P

C
P P P
15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P

M
P P P P

E
P P P P

C
P P P


P P P
15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P

M
P P P P

E
P P P P

C
P P P


P P P
15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P

M
P P P P

E
P P P P

C
P P P


P P P
15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P

M
P P P P

E
P P P P

C
P P P


P P P
15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P

M
P P P P

E
P P P P

C
P P P


P PP
15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P

M
P P P P

E
P P P P

C
P P P


P PP


P PP
15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P

M
P P P P

E
P P P P

C
P P P


P PP


P PP
15.17 Example
Now P(PP) becomes provable, and so do any other classical tautologies:

I I
P P P P

M
P P P P

E
P P P P

C
P P P


P PP


P  (P  P)
15.18 CL5 versus multiplicative affine logic
Affine logic is a variation of the famous linear logic. Multiplicative affine logic is
obtained from system G1 (see Episode 4) by deleting Contraction (as for linear logic,
it further deletes Weakening as well).

Our CL5 is also obtained by deleting Contraction from a deductive system for
classical logic, and it is natural to ask how the two compare. Here is the answer:

Fact 15.3. Every formula provable in multiplicative affine logic is also provable in
CL5, but not vice versa: some formulas provable in CL5 are not provable in
affine logic.

Blass’s principle
( (P  Q )  (R  S ))  ( (P  R )  (Q  S ))
proven on slide 15.13 is an example of a formula provable in CL5 but not in affine
logic. In fact, one can show that any proof of Blass’s principle in G1 would
require using not only Contraction, but also Weakening. On the other hand, our
CL5-proof of it used neither Weakening nor Contraction (nor Duplication).