"Every Countable Poset is Embeddable in the Poset of Unsolvable Terms."

Richard Statman (1986)

Details and statistics

DOI: 10.1016/0304-3975(86)90085-X

access: open

type: Journal Article

metadata version: 2021-02-17

a service of  Schloss Dagstuhl - Leibniz Center for Informatics