- 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
Variations on promptly simple sets
Journal of Symbolic Logic 50 (1):138-148 (1985)
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
Wtt-degrees and t-degrees of R.e. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.
On orbits, of prompt and low computably enumerable sets.Kevin Wald - 2002 - Journal of Symbolic Logic 67 (2):649-678.
Definable incompleteness and Friedberg splittings.Russell Miller - 2002 - Journal of Symbolic Logic 67 (2):679-696.
Nowhere simple sets and the lattice of recursively enumerable sets.Richard A. Shore - 1978 - Journal of Symbolic Logic 43 (2):322-330.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Sets and Point-Sets: Five Grades of Set-Theoretic Involvement in Geometry.John P. Burgess - 1988 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:456 - 463.
In defense of the simplest quantified modal logic.Bernard Linsky & Edward N. Zalta - 1994 - Philosophical Perspectives 8:431-458.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Analytics
Added to PP
2009-01-28
Downloads
18 (#811,325)
6 months
1 (#1,510,037)
2009-01-28
Downloads
18 (#811,325)
6 months
1 (#1,510,037)
Historical graph of downloads
Citations of this work
There is no fat orbit.Rod Downey & Leo Harrington - 1996 - Annals of Pure and Applied Logic 80 (3):277-289.
Definable properties of the computably enumerable sets.Leo Harrington & Robert I. Soare - 1998 - Annals of Pure and Applied Logic 94 (1-3):97-125.
References found in this work
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
The intervals of the lattice of recursively enumerable sets determined by major subsets.Wolfgang Maass & Michael Stob - 1983 - Annals of Pure and Applied Logic 24 (2):189-212.
A recursively enumerable degree which will not split over all lesser ones.Alistair H. Lachlan - 1976 - Annals of Mathematical Logic 9 (4):307.
Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets.Robert I. Soare - 1982 - Annals of Mathematical Logic 22 (1):69.
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-7c76586df8-l2pxr uwo