Every countable poset is embeddable in the poset of unsolvable terms

DOI10.1016/0304-3975(86)90085-XzbMath0637.03013OpenAlexW2062145103MaRDI QIDQ1098834

Richard Statman

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90085-x

zbMATH Keywords

quotient posetcountable posetcomputational behaviourclosed \(\lambda \)-termmodels of \(\lambda \)-calculussolvable termsunsolvable combinators

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• Foundational studies. Selected works. Vol. I, II
• Unnamed Item

This page was built for publication: Every countable poset is embeddable in the poset of unsolvable terms