Recursively enumerable complexity sequences and measure independence

Journal of Symbolic Logic 45 (3):417-438 (1980)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273412

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

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

Recursively Enumerable Classes and Their Application to Recursive Sequences of Formal Theories.Marian Boykan Pour-el, Hilary Putnam, William A. Howard & A. H. Lachlan - 1973 - Journal of Symbolic Logic 38 (1):155-156.
On complexity properties of recursively enumerable sets.M. Blum & I. Marques - 1973 - Journal of Symbolic Logic 38 (4):579-593.
Minimal upper bounds for ascending sequences of α-recursively enumerable degrees.C. T. Chong - 1976 - Journal of Symbolic Logic 41 (1):250-260.
Review: Emil L. Post, Recursively Enumerable Sets of Positive Integers and Their Decision Problems. [REVIEW]J. C. C. McKinsey - 1945 - Journal of Symbolic Logic 10 (1):18-19.
Simplicity of Recursively Enumerable Sets.Two Theorems on hyperhypersimple Sets.On the Lattice of Recursively Enumerable Sets.The Elementary Theory of Recursively Enumerable Sets.Robert W. Robinson & A. H. Lachlan - 1970 - Journal of Symbolic Logic 35 (1):153-155.
Recursively enumerable classes and their application to recursive sequences of formal theories.Marian Boykan Pour-El & Hilary Putnam - 1965 - Archive for Mathematical Logic 8 (3-4):104-121.
Review: A. Mostowski, On a System of Axioms which has no Recursively Enumerable Arithmetic Model; A. Mostowski, A Formula with no Recursively Enumerable Model. [REVIEW]G. Hasenjaeger - 1958 - Journal of Symbolic Logic 23 (1):45-45.
Mitotic recursively enumerable sets.Richard E. Ladner - 1973 - Journal of Symbolic Logic 38 (2):199-211.
Post Emil L.. Recursively enumerable sets of positive integers and their decision problems. Bulletin of the American Mathematical Society, vol. 50 , pp. 284–316. [REVIEW]J. C. C. McKinsey - 1945 - Journal of Symbolic Logic 10 (1):18-19.
Simplicity of recursively enumerable sets.Robert W. Robinson - 1967 - Journal of Symbolic Logic 32 (2):162-172.

Analytics

Added to PP
2009-01-28

Downloads
15 (#948,985)

6 months
2 (#1,448,741)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Review: Alfred Tarski, Undecidable Theories. [REVIEW]Martin Davis - 1959 - Journal of Symbolic Logic 24 (2):167-169.

Add more references