IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4613-0897-3_7.html
   My bibliography  Save this book chapter

A Completeness Theorem for Higher-Order Intuitionistic Logic: An Intuitionistic Proof

In: Mathematical Logic and Its Applications

Author

Listed:
  • A. G. Dragalin

    (Debrecen University)

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.

Suggested Citation

  • A. G. Dragalin, 1987. "A Completeness Theorem for Higher-Order Intuitionistic Logic: An Intuitionistic Proof," Springer Books, in: Dimiter G. Skordev (ed.), Mathematical Logic and Its Applications, pages 107-124, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4613-0897-3_7
    DOI: 10.1007/978-1-4613-0897-3_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4613-0897-3_7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.