Richard Statman Every Countable Poset is Embeddable in the Poset of Unsolvable Terms. 95-100 1986 48 Theor. Comput. Sci. 3 db/journals/tcs/tcs48.html#Statman86