Logical connectives for intuitionistic propositional logic

In classical propositional logic it is well known that 7, ⊃ is a functionally complete set with respect to a two-valued truth function modeling. I. e. all definable logical connectives are definable from 7 and ⊃. Other modelings of classical type propositional logics may have different functionally complete sets; for example, multivalued truth function modelings. This paper examines the question of a functionally complete set of logical connectives for intuitionistic propositional logic with respect to S. Kripke's modeling for intuitionistic logic.