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)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19760220102

Other Versions

reprint Case, John (1976) "Sortability and Extensibility of the Graphs of Recursively Enumerable Partial and Total Orders". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22(1):1-18

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,865

External links

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

Through your library

My notes

Similar books and articles

Some Remarks on Extensibility, Confluence of Paths, Branching Properties, and Index Sets, for Certain Recursively Enumerable Graphs.T. G. Mclaughlin - 1969 - Journal of Symbolic Logic 34 (3):518-518.
Complete, Recursively Enumerable Relations in Arithmetic.Giovanna D'Agostino & Mario Magnago - 1995 - Mathematical Logic Quarterly 41 (1):65-72.
On a Class of Recursively Enumerable Sets.Farzad Didehvar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.
McLaughlin T. G.. Some remarks on extensibility, confluence of paths, branching properties, and index sets, for certain recursively enumerable graphs. Illinois journal of mathematics, vol. 11 , pp. 257–279. [REVIEW]Wayne Richter - 1969 - Journal of Symbolic Logic 34 (3):518-518.
Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets.Manuel Lerman - 1991 - Mathematical Logic Quarterly 37 (19‐22):331-342.
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.

Analytics

Added to PP
2013-12-01

Downloads
21 (#1,003,416)

6 months
6 (#854,611)

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