Hostname: page-component-745bb68f8f-lrblm Total loading time: 0 Render date: 2025-02-11T06:19:51.516Z Has data issue: false hasContentIssue false
  • English
  • Français

On the existence of n but not n + 1 easy combinators

Published online by Cambridge University Press:  01 August 1999

RICK STATMAN
RICK STATMAN
Affiliation:
Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, USA
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Recall that M is easy if it is consistent with every combinator. We say that M is m-easy if there is no proof with < m + 1 steps that M is inconsistent with any combinator. Obviously, if M is easy, it is m-easy for each m. Here we shall show that for infinitely many m there are m but not m + 1 easy terms.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 9 , Issue 4 , August 1999 , pp. 361 - 365
Copyright
© 1999 Cambridge University Press