 A Completeness Theorem for Higher-Order Intuitionistic Logic: An Intuitionistic ProofA. G. Dragalin
A chapter in Mathematical Logic and Its Applications, 1987, pp 107-124 from Springer Abstract: Abstract The Goedel’s famous completeness theorem for predicate logic is the foundation of modern model theory in classic logic as well as in intuitionistic one. Moreover, this theorem is intensively used in the theory of mechanical theorem proving [1] and in the theory of logic programming [2]. So there is an insistent aspiration for constructive treating of this theorem. Usual proofs of the completeness theorem are founded on considerations of maximal consistent sets of formulas and are nonconstructive (see, for example, [1] for classical case and [3] for intuitionistic logic). The situation is specially urgent in the intuitionistic case because this logic is intended for effective treating of logical connectives and is used usually in computer science as an instrument for getting a program from a constructive (= intuitionistic) proof of a given formula. A nonconstructive completeness proof in this situation can serve only as a general indication for possible success of a given proof-searching procedure, just as a constructive proof provides precise bounds for complexity of searching. Date: 1987 There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0897-3_7 Ordering information: This item can be ordered from DOI: 10.1007/978-1-4613-0897-3_7 Access Statistics for this chapter More chapters in Springer Books from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.