[Submit a comment] [RTALooP home] [Index] [Previous] [Next] | [Postscript] [PDF] [BibTeX Source] [LaTeX Source] |

*Originator: Richard Statman *

*Date: June 1993*

Summary: In theλ-calculus, which sets have the form{M|Q→^{*}PM}?

It has been proved that (in λ-calculus or Combinatory Logic) every
recursively enumerable set of ground terms that is closed under conversion
has the form {*M* | *PM* ↔^{*} *Q*} for some *P* and *Q*.
Which sets have the form {*M* | *Q* →^{*} *PM*}?

[Submit a comment] [RTALooP home] [Index] [Previous] [Next] | [Postscript] [PDF] [BibTeX Source] [LaTeX Source] |