A simplification of combinatory logic

DOI10.2307/2272970zbMath0264.02024OpenAlexW2001469185MaRDI QIDQ5680100

Nicolas D. Goodman

Publication date: 1972

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272970

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

An extension of Klop's counterexample to the Church-Rosser property to \(\lambda\)-calculus with other ordered pair combinators, Call-by-value combinatory logic and the lambda-value calculus, Call-by-name, call-by-value and the \(\lambda\)-calculus, Predicate calculus and naive set theory in pure combinatory logic