Hostname: page-component-77c89778f8-vsgnj Total loading time: 0 Render date: 2024-07-17T09:34:22.829Z Has data issue: false hasContentIssue false

Some results on combinators in the system TRC

Published online by Cambridge University Press:  12 March 2014

Thomas Jech*
Department of Mathematics, The Pennsylvania State University, 218 Mcallister Bldg., University Park, PA 16802, U.S.A., E-mail:


We investigate the system TRC of untyped illative combinatory logic that is equiconsistent with New Foundations. We prove that various unstratified combinators do not exist in TRC.

Research Article
Copyright © Association for Symbolic Logic 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)



[1]Curry, H. and Feys, R., Combinatory logic, North-Holland Publishing Company, Amsterdam, 1958.Google Scholar
[2]Hindley, J. R. and Seldin, J. P., Introduction to combinators and λ-calculus, Cambridge University Press, 1986.Google Scholar
[3]Holmes, M. R., Systems of combinatory logic related to Quine's ‘New Foundations’, Annals of Pure and Applied Logic, vol. 53 (1991), pp. 103133.CrossRefGoogle Scholar
[4]Jech, T., OTTER experiments in a system of combinatory logic, Journal of Automated Reasoning, vol. 14 (1995), pp. 413426.CrossRefGoogle Scholar
[5]McCune, W. W., OTTER 3.0, Argonne National Laboratory, 1994.CrossRefGoogle Scholar
[6]Quine, W. V., New foundations for mathematical logic, The American Mathematical Monthly, vol. 44 (1937), pp. 7080.CrossRefGoogle Scholar
[7]Smullyan, R., To mock a mockingbird, A. Knopf, New York, 1985.Google Scholar