## 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.

## Access this chapter

Tax calculation will be finalised at checkout

Purchases are for personal use only

## Preview

Unable to display preview. Download preview PDF.

### Similar content being viewed by others

## References

Chin-Liang Chang and R. Char-Tung Lee, “Symbolic Logic and Mechanical Theorem Proving” Academic Press (1973).

K. R. Apt and M. H. van Emden, Contributions to the theory of logic programming,

__J. Assoc. Comput. Mach.__, 29, 3:841–862 (1982).A. G. Dragalin, Mathematical intuitionism. Introduction to proof theory (in Russian),

__Nauka__, Moscow (1979).K. L. Clark, An introduction to logic programming,

__in__: “Introductory Readings in Expert Systems”, D. Michie, ed., Gordon & Breach Sci. Publ., pp. 93–112 (1982).E. W. Beth, “The Foundations of Mathematics”, North- Holland, Amsterdam (1959).

S. A. Kripke, Semantical analysis of intuitionistic logic I,

__in__: “Formal Systems and Recursive Functions”, North-Holland, Amsterdam, pp. 92–129 (1965).V. H. Dyson and G. Kreisel, Analysis of Beth’s semantic construction of intuitionistic logic,

__Stanford Report__(1961).W. Veldman, An intuitionistic completeness theorem for intuitionistic predicate logic,

*J. Symbolic Logic*, 41, No. 1:159–166 (1976).G. K. Lopez-Escobar and W. Veldman, Intuitionistic completeness of a restricted second order logic,

__Lect. Notes Math.__, 500;198–232 (1975).H. de Swart, Another intuitionistic completeness proof,

__J. Symbolic Logic__, 41, No. 3:644–662 (1976).H. de Swart, First steps in intuitionistic model theory,

__J. Symbolic Logic__, 43, No. 1;3–12 (1978).Takahashi Moto-o, Cut-elimination theorem and Brouwerian-valued models for intuitionistic type theory,

__Comment Math. Univ. St. Pauli__, XIX-I:55–72 (1970).A. G. Dragalin, “A Completeness Theorem for Intuitionistic Predicate Logic. An Intuitionistic Proof”, Publicationes Mathematicae Debrecen, to appear.

A. G. Dragalin, “Cut-elimination Theorem for Higher-Order Classical Logic. An Intuitionistic Proof”, this volume.

H. Rasiowa and R. Sikorski, “The Mathematics of Metamathematics”, second ed., Warszawa (1968).

## Author information

### Authors and Affiliations

## Editor information

### Editors and Affiliations

## Rights and permissions

## Copyright information

© 1987 Plenum Press, New York

## About this chapter

### Cite this chapter

Dragalin, A.G. (1987). A Completeness Theorem for Higher-Order Intuitionistic Logic: An Intuitionistic Proof. In: Skordev, D.G. (eds) Mathematical Logic and Its Applications. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0897-3_7

### Download citation

DOI: https://doi.org/10.1007/978-1-4613-0897-3_7

Publisher Name: Springer, Boston, MA

Print ISBN: 978-1-4612-8234-1

Online ISBN: 978-1-4613-0897-3

eBook Packages: Springer Book Archive