Hostname: page-component-8448b6f56d-wq2xx Total loading time: 0 Render date: 2024-04-19T20:49:27.084Z Has data issue: false hasContentIssue false
  • English
  • Français

Partially ordered sets representable by recursively enumerable classes1

Published online by Cambridge University Press:  12 March 2014

J. B. Florence
J. B. Florence*
Affiliation:
Simon Fraser University and University of Western Ontario
Get access Rights & Permissions [Opens in a new window]

Extract

A partially ordered (p.o.) set (P, ≼) is represented by the recursively enumerable (r.e.) class C if (P, ≼) is order isomorphic to (C, ⊆), that is to the p.o. set consisting of C ordered by the inclusion relation. (P, ≼.) is representable if it is represented by some r.e. class. N will denote the set of natural numbers.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 34 , Issue 1 , 29 May 1969 , pp. 8 - 12
Copyright
Copyright © Association for Symbolic Logic 1969

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

1

This work was supported in part by Canadian NRC grants A-3024, A-3040. It forms part of the author's doctoral dissertation at Simon Fraser University.

References

[1]Kleene, S. C., Introduction to metamathematics, Van Nostrand, Princeton, N.J., 1952.Google Scholar