Sortability and Extensibility of the Graphs of Recursively Enumerable Partial and Total Orders

Mathematical Logic Quarterly 22 (1):1-18 (1976)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,867

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Sortability and Extensibility of the Graphs of Recursively Enumerable Partial and Total Orders.John Case - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):1-18.
On a Class of Recursively Enumerable Sets.Farzad Didehvar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.
Sublattices of the Recursively Enumerable Degrees.S. K. Thomason - 1971 - Mathematical Logic Quarterly 17 (1):273-280.
A Dichotomy of the Recursively Enumerable Sets.Robert W. Robinson - 1968 - Mathematical Logic Quarterly 14 (21-24):339-356.
A Dichotomy of the Recursively Enumerable Sets.Robert W. Robinson - 1968 - Mathematical Logic Quarterly 14 (21‐24):339-356.

Analytics

Added to PP
2013-12-01

Downloads
13 (#1,040,422)

6 months
4 (#1,004,663)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Introduction to mathematical logic.Elliott Mendelson - 1964 - Princeton, N.J.,: Van Nostrand.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Introduction to Mathematical Logic.John Corcoran - 1964 - Journal of Symbolic Logic 54 (2):618-619.

Add more references