Abstract

In the paper, we define some classes of sequents of the propositional intuitionistic logic. These are classes of primarily and α-primarily reducible sequents. Then we show how derivability of these sequents in a propositional intuitionistic logic sequent calculus LJ0 can be checked by means of a propositional classical logic sequent calculus LK0.

Highlights

  • In the paper, we define some classes of sequents of the propositional intuitionistic logic

  • We show how derivability of these sequents in a propositional intuitionistic logic sequent calculus LJ0 can be checked by means of a propositional classical logic sequent calculus LK0

  • LJ0 is a variant of the intuitionistic propositional Gentzen-like sequent calculus. It is obtained from LK0 by the following changes

Read more

Summary

Introduction

We define some classes of sequents of the propositional intuitionistic logic. These are classes of primarily and α-primarily reducible sequents. We show how derivability of these sequents in a propositional intuitionistic logic sequent calculus LJ0 can be checked by means of a propositional classical logic sequent calculus LK0. We introduce the calculi LK0 and LJ0. We define the class of primarily reducible sequents. Further we modify LK0 and LJ0 and introduce the class of α-primarily reducible sequents. We define a subclass of α-reducible sequents by introducing some restriction on syntax of sequents

Calculi LK0 and LJ0
Primary sequents
Modifications of LK0 and LJ0
Some expansion of the class of α-primarily reducible sequents
Definition of a subclass of α-primarily reducible sequents
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call