RO  EN
IMCS/Publications/BASM/Issues/BASM n.1 (53), 2007/

Infinitely many functional pre-complete classes of formulas in the propositional provability intuitionistic logic.

Authors: Rusu Andrei

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

Adobe PDF document0.10 Mb