Scott–Curry theorem
id:
scott-curry-theorem-321-3309800
title:
Scott–Curry theorem
text:
In mathematical logic, the Scott–Curry theorem is a result in lambda calculus stating that if two non-empty sets of lambda terms A and B are closed under beta-convertibility then they are recursively inseparable.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Scott%E2%80%93Curry_theorem
date created:
date modified:
2021-04-24T23:18:13Z
main entity:
{"identifier":"Q65052615","url":"https://www.wikidata.org/entity/Q65052615"}
image:
fields total:
13
integrity:
13