


default search action
"Every Countable Poset is Embeddable in the Poset of Unsolvable Terms."
Richard Statman (1986)
- Richard Statman:
Every Countable Poset is Embeddable in the Poset of Unsolvable Terms. Theor. Comput. Sci. 48(3): 95-100 (1986)

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.