Chapter

Fields of Logic and Computation

Volume 6300 of the series Lecture Notes in Computer Science pp 75-94

Strict Canonical Constructive Systems

  • Arnon AvronAffiliated withSchool of Computer Science, Tel Aviv University
  • , Ori LahavAffiliated withSchool of Computer Science, Tel Aviv University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We define the notions of a canonical inference rule and a canonical constructive system in the framework of strict single-conclusion Gentzen-type systems (or, equivalently, natural deduction systems), and develop a corresponding general non-deterministic Kripke-style semantics. We show that every strict constructive canonical system induces a class of non-deterministic Kripke-style frames, for which it is strongly sound and complete. This non-deterministic semantics is used for proving a strong form of the cut-elimination theorem for such systems, and for providing a decision procedure for them. These results identify a large family of basic constructive connectives, including the standard intuitionistic connectives, together with many other independent connectives.

Keywords

sequent calculus cut-elimination non-classical logics non-deterministic semantics Kripke semantics