- 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
Dynamic properties of computably enumerable sets
In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, enumerability, unsolvability: directions in recursion theory. New York: Cambridge University Press. pp. 224--105 (1996)
Abstract
This article has no associated abstract. (fix it)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
Definability, automorphisms, and dynamic properties of computably enumerable sets.Leo Harrington & Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (2):199-213.
Implicit measurements of dynamic complexity properties and splittings of speedable sets.Michael A. Jahn - 1999 - Journal of Symbolic Logic 64 (3):1037-1064.
On the filter of computably enumerable supersets of an r-maximal set.Steffen Lempp, André Nies & D. Reed Solomon - 2001 - Archive for Mathematical Logic 40 (6):415-423.
Differences of Computably Enumerable Sets.A. Nies & S. Lempp - 2000 - Mathematical Logic Quarterly 46 (4):555-562.
An Interval of Computably Enumerable Isolating Degrees.Matthew C. Salts - 1999 - Mathematical Logic Quarterly 45 (1):59-72.
Codable sets and orbits of computably enumerable sets.Leo Harrington & Robert I. Soare - 1998 - Journal of Symbolic Logic 63 (1):1-28.
Definable properties of the computably enumerable sets.Leo Harrington & Robert I. Soare - 1998 - Annals of Pure and Applied Logic 94 (1-3):97-125.
Computability Results Used in Differential Geometry.Barbara F. Csima & Robert I. Soare - 2006 - Journal of Symbolic Logic 71 (4):1394 - 1410.
On orbits, of prompt and low computably enumerable sets.Kevin Wald - 2002 - Journal of Symbolic Logic 67 (2):649-678.
Review: Robert I. Soare, Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets. [REVIEW]Eberhard Herrmann & Rodney Downey - 1990 - Journal of Symbolic Logic 55 (1):356-357.
The computably enumerable degrees are locally non-cappable.Matthew B. Giorgi - 2004 - Archive for Mathematical Logic 43 (1):121-139.
A random set which only computes strongly jump-traceable C.e. Sets.Noam Greenberg - 2011 - Journal of Symbolic Logic 76 (2):700 - 718.
Every incomplete computably enumerable truth-table degree is branching.Peter A. Fejer & Richard A. Shore - 2001 - Archive for Mathematical Logic 40 (2):113-123.
Computably enumerable sets below random sets.André Nies - 2012 - Annals of Pure and Applied Logic 163 (11):1596-1610.
Analytics
Added to PP
2014-01-26
Downloads
72 (#228,439)
6 months
6 (#520,934)
2014-01-26
Downloads
72 (#228,439)
6 months
6 (#520,934)
Historical graph of downloads
Citations of this work
On the definability of the double jump in the computably enumerable sets.Peter A. Cholak & Leo A. Harrington - 2002 - Journal of Mathematical Logic 2 (02):261-296.
Definable encodings in the computably enumerable sets.Peter A. Cholak & Leo A. Harrington - 2000 - Bulletin of Symbolic Logic 6 (2):185-196.
The complexity of orbits of computably enumerable sets.Peter A. Cholak, Rodney Downey & Leo A. Harrington - 2008 - Bulletin of Symbolic Logic 14 (1):69 - 87.
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-64dd777598-pjbg5 uwo