Frederic B. Fitch. The system CΔ of combinatory logic. The journal of symbolic logic, vol. 28 no. 1 (for 1963, pub. 1964), pp. 87–97.

Journal of Symbolic Logic ◽

10.2307/2270380 ◽

1964 ◽

Vol 29 (4) ◽

pp. 198-199

Author(s):

Bruce Lercher

Keyword(s):

Combinatory Logic ◽

Symbolic Logic

Download Full-text

Roger Hindley. Axioms for strong reduction in combinatory logic. The journal of symbolic logic, vol. 32 (1967), pp. 224–236. - Bruce Lercher. The decidability of Hindley's axioms for strong reduction. The journal of symbolic logic, vol. 32 (1967), pp. 237–239.

Journal of Symbolic Logic ◽

10.2307/2271572 ◽

1971 ◽

Vol 36 (1) ◽

pp. 171-172

Author(s):

Haskell B. Curry

Keyword(s):

Combinatory Logic ◽

Symbolic Logic ◽

Strong Reduction

Download Full-text

Haskell B. Curry. A revision of the fundamental rules of combinatory logic. The journal of symbolic logic, vol. 6 (1941), pp. 41–53. - Haskell B. Curry. Consistency and completeness of the theory of combinators. The journal of symbolic logic, vol. 6 pp. 54–61.

Journal of Symbolic Logic ◽

10.2307/2267125 ◽

1941 ◽

Vol 6 (4) ◽

pp. 170-170

Author(s):

Barkley Rosser

Keyword(s):

Combinatory Logic ◽

Symbolic Logic

Download Full-text

Haskell B. Curry. Combinatory logic. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 90–99.

Journal of Symbolic Logic ◽

10.2307/2271690 ◽

1967 ◽

Vol 32 (2) ◽

pp. 267-267

Author(s):

J. Barkley Rosser

Keyword(s):

Combinatory Logic ◽

Symbolic Logic ◽

Summer Institute ◽

Cornell University ◽

Research Division

Download Full-text

John T. Kearns. Combinatory logic with discriminators. The journal of symbolic logic, vol. 34 (1969), pp. 561–575.

Journal of Symbolic Logic ◽

10.2307/2272102 ◽

1973 ◽

Vol 38 (2) ◽

pp. 339-340

Author(s):

Jonathan P. Seldin

Keyword(s):

Combinatory Logic ◽

Symbolic Logic

Download Full-text

Bruce Lercher. Strong reduction and normal form in combinatory logic. The journal of symbolic logic, vol. 32 (1967), pp. 213–223.

Journal of Symbolic Logic ◽

10.2307/2271571 ◽

1971 ◽

Vol 36 (1) ◽

pp. 171-171

Author(s):

Luis E. Sanchis

Keyword(s):

Normal Form ◽

Combinatory Logic ◽

Symbolic Logic ◽

Strong Reduction

Download Full-text

2004 Spring Meeting of the Association for Symbolic Logic

Bulletin of Symbolic Logic ◽

10.2178/bsl/1102022666 ◽

2004 ◽

Vol 10 (3) ◽

pp. 438-446

Author(s):

Michael Kremer

Keyword(s):

Symbolic Logic ◽

Spring Meeting

Download Full-text

Association for Symbolic Logic

Bulletin of Symbolic Logic ◽

10.2178/bsl/1231081468 ◽

2008 ◽

Vol 14 (4) ◽

pp. 553-558

Keyword(s):

Symbolic Logic

Download Full-text

European Summer Meeting of the Association for Symbolic Logic, Helsinki, 1990

Journal of Symbolic Logic ◽

10.2178/jsl/1183743771 ◽

1991 ◽

Vol 56 (3) ◽

pp. 1115-1150

Keyword(s):

Symbolic Logic

Download Full-text

2008 Annual Meeting of the Association for Symbolic Logic

Bulletin of Symbolic Logic ◽

10.2178/bsl/1231081376 ◽

2008 ◽

Vol 14 (3) ◽

pp. 418-437

Author(s):

Chris Laskowski

Keyword(s):

Annual Meeting ◽

Symbolic Logic

Download Full-text

2008–2009 Winter Meeting of the Association for Symbolic Logic

Bulletin of Symbolic Logic ◽

10.2178/bsl/1243948489 ◽

2009 ◽

Vol 15 (2) ◽

pp. 237-245

Author(s):

Ali Enayat

Keyword(s):

Symbolic Logic

Download Full-text