Show simple item record

dc.contributor.authorUnderwood, Judithen_US
dc.date.accessioned2007-04-23T17:51:22Z
dc.date.available2007-04-23T17:51:22Z
dc.date.issued1990-12en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1179en_US
dc.identifier.urihttps://hdl.handle.net/1813/7019
dc.description.abstractThis 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.en_US
dc.format.extent824362 bytes
dc.format.extent197270 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleA Constructive Completeness Proof for Intuitionistic Propositional Calculusen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics