Reducibilities in two models for combinatory logic

Journal of Symbolic Logic 44 (2):221-234 (1979)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273730

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,388

External links

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

Through your library

My notes

Similar books and articles

Luis E. Sanchis. Types in combinatory logic. Notre Dame journal of formal logic, vol. 5 no. 3 , pp. 161–180.Jean Ladriere - 1967 - Journal of Symbolic Logic 32 (3):420-421.
Luis E. Sanchis. Recursive functional. Studies in logic and the foundations of mathematics, vol. 131. North-Holland, Amsterdam etc. 1992, xii + 277 pp. [REVIEW]Peter G. Hinman - 1993 - Journal of Symbolic Logic 58 (4):1468-1469.
Luis E. Sanchis. Set theory—an operational approach. Gordon and Breach Science Publishers, Amsterdam etc. 1996, xvi + 279 pp. [REVIEW]J. P. Mayberry - 1998 - Journal of Symbolic Logic 63 (2):751-752.
Review: Luis Elpidio Sanchis, Neuva Demonstracion de la Completicidad Funcional del Calculo Proposicional Bivalente. [REVIEW]Alonzo Church - 1962 - Journal of Symbolic Logic 27 (4):471-471.
Constructive set theoretic models of typed combinatory logic.Andreas Knobel - 1993 - Journal of Symbolic Logic 58 (1):99-118.
Studies in Illative Combinatory Logic.J. P. Seldin - 1968 - V.R.B. Offsetdrukkerij.
Reducibilities in intuitionistic topology.Dirk Van Dalen - 1968 - Journal of Symbolic Logic 33 (3):412-417.
Forcing and reducibilities.Piergiorgio Odifreddi - 1983 - Journal of Symbolic Logic 48 (2):288-310.
Combinatory Logic.Haskell B. Curry, J. Roger Hindley & Jonathan P. Seldin - 1977 - Journal of Symbolic Logic 42 (1):109-110.
A simplification of combinatory logic.Nicolas D. Goodman - 1972 - Journal of Symbolic Logic 37 (2):225-246.

Analytics

Added to PP
2009-01-28

Downloads
35 (#678,037)

6 months
11 (#246,005)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Finite type structures within combinatory algebras.Inge Bethke - 1991 - Annals of Pure and Applied Logic 55 (2):101-123.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Combinatory Logic.Haskell B. Curry, J. Roger Hindley & Jonathan P. Seldin - 1977 - Journal of Symbolic Logic 42 (1):109-110.
Enumeration reducibility and partial degrees.John Case - 1971 - Annals of Mathematical Logic 2 (4):419-439.
General Topology.John L. Kelley - 1962 - Journal of Symbolic Logic 27 (2):235-235.
Hyperenumeration reducibility.Luis E. Sanchis - 1978 - Notre Dame Journal of Formal Logic 19 (3):405-415.

Add more references