Underwood, Judith2007-04-232007-04-231990-12http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1179https://hdl.handle.net/1813/7019This paper presents a constructive proof of completeness of Kripke models for the intuitionistic propositional calculus. The computational content of the proof is a form of the tableau decision procedure. If a formula is valid, the algorithm produces a proof of the formula in the form of an inhabitant of the corresponding type; if not, it produces a Kripke model and a state in the model such that the formula is not forced at that state in that model.824362 bytes197270 bytesapplication/pdfapplication/postscripten-UScomputer sciencetechnical reporttechnical report