- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On complexity properties of recursively enumerable sets
Journal of Symbolic Logic 38 (4):579-593 (1973)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Isomorphism of Systems of Recursively Enumerable Sets with Effective Properties.E. Mendelson - 1967 - Journal of Symbolic Logic 32 (3):393-394.
Robinson Raphael M.. Arithmetical representation of recursively enumerable sets. [REVIEW]Hilary Putnam - 1959 - Journal of Symbolic Logic 24 (2):170-171.
Review: C. E. M. Yates, Recursively Enumerable Sets and Retracting Functions. [REVIEW]Hartley Rogers - 1967 - Journal of Symbolic Logic 32 (3):394-394.
Review: C. E. M. Yates, Three Theorems on the Degrees of Recursively Enumerable Sets. [REVIEW]Hartley Rogers - 1967 - Journal of Symbolic Logic 32 (3):394-395.
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.
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.
Recursively enumerable m- and tt-degrees. I: The quantity of m- degrees.R. G. Downey - 1989 - Journal of Symbolic Logic 54 (2):553-567.
Analytics
Added to PP
2009-01-28
Downloads
48 (#460,678)
6 months
21 (#142,105)
2009-01-28
Downloads
48 (#460,678)
6 months
21 (#142,105)
Historical graph of downloads
Citations of this work
Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
Degree structures of conjunctive reducibility.Irakli Chitaia & Roland Omanadze - 2021 - Archive for Mathematical Logic 61 (1):19-31.
Some structural properties of quasi-degrees.Roland Sh Omanadze - 2018 - Logic Journal of the IGPL 26 (1):191-201.
On speedable and levelable vector spaces.Frank A. Bäuerle & Jeffrey B. Remmel - 1994 - Annals of Pure and Applied Logic 67 (1-3):61-112.
Non-empty open intervals of computably enumerable sQ 1-degrees.Roland Omanadze & Irakli Chitaia - forthcoming - Logic Journal of the IGPL.
References found in this work
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-sfdq8 dc2