Completeness of the propositions-as-types interpretation of intuitionistic logic into illative combinatory logic

Journal of Symbolic Logic 63 (3):869-890 (1998)
  Copy   BIBTEX


Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. In a preceding paper, [2], we considered 4 systems of illative combinatory logic that are sound for first order intuitionistic propositional and predicate logic. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators, or in a more direct way, in which derivations are not translated. Both translations are closely related in a canonical way. In the cited paper we proved completeness of the two direct translations. In the present paper we prove that also the two indirect translations are complete. These proofs are direct whereas in another version, [3], we proved completeness by showing that the two corresponding illative systems are conservative over the two systems for the direct translations. Moreover we shall prove that one of the systems is also complete for predicate calculus with higher type functions



    Upload a copy of this work     Papers currently archived: 93,098

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Bunder’s paradox.Michael Caie - 2020 - Review of Symbolic Logic 13 (4):829-844.
Some results on combinators in the system TRC.Thomas Jech - 1999 - Journal of Symbolic Logic 64 (4):1811-1819.
Some Results on Combinators in the System TRC.Thomas Jech - 1999 - Journal of Symbolic Logic 64 (4):1811-1819.
Conjunction without conditions in illative combinatory logic.M. Bunder - 1984 - Bulletin of the Section of Logic 13 (4):207-213.


Added to PP

62 (#266,970)

6 months
15 (#185,276)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Typed lambda calculus.Henk P. Barendregt, Wil Dekkers & Richard Statman - 1977 - In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 1091--1132.

Add more citations

References found in this work

Typed Lambda calculi. S. Abramsky et AL.H. P. Barendregt - 1992 - In S. Abramsky, D. Gabbay & T. Maibaurn (eds.), Handbook of Logic in Computer Science. Oxford University Press. pp. 117--309.

Add more references