Authors: Rusu Andrei
– 0.10 Mb
Abstract
We consider the propositional provability intuitionistic logic IΔ, introduced by A.V. Kuznetsov [2]. We prove that there are infinitely many classes of formulas in the calculus of IΔ, which are pre-complete with respect to functional expressibility in IΔ. This result is stronger than an ealier one stated by the author in [1].E-mail: ,
Fulltext
– 0.10 Mb
