In this paper we introduce effectiveness into model theory of intuitio
nistic logic. The main result shows that any computable theory T of in
tuitionistic predicate logic has a Kripke model with decidable forcing
such that for any sentence phi, phi is forced in the model if and onl
y if phi is intuitionistically deducible from T. (C) 1998 Published by
Elsevier Science B.V. All rights reserved.