Syntax and semantics of superintuitionistic logics (Q920079)

The aim of this paper is to study general properties of superintuitionistic logics basing on the introduction of a special kind of canonical formulas. It is shown that any superintuitionistic logic (s.l.) can be axiomatized by means of canonical formulas. At the same time, it is proved that any set of formulas with the above mentioned property can be decreased, that is, the set of all s.l. has no axiomatical basis. By means of the introduced tools of canonical formulas, the author gives a solution of the Dummet-Lemmon hypothesis about the largest modal counterpart. It is proved that the finite model property is preserved under going to the smallest counterpart. New examples of modal counterparts of \({\mathcal I}nt\) without finite model property are given. Properties of s.l. with axioms in restricted languages are considered.