- 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
Some orbits for E
Annals of Pure and Applied Logic 107 (1-3):193-226 (2001)
Abstract
In this article we establish the existence of a number of new orbits in the automorphism group of the computably enumerable sets. The degree theoretical aspects of these orbits also are examined.Other Versions
No versions found
My notes
Similar books and articles
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.
Quantum Wells in Tilted Fields: Semiclassical Amplitudes and Phase Coherence Times. [REVIEW]T. S. Monteiro & D. S. Saraga - 2001 - Foundations of Physics 31 (2):355-370.
Boolean algebras and orbits of the lattice of R.e. Sets modulo the finite sets.Peter Cholak - 1990 - Journal of Symbolic Logic 55 (2):744-760.
Angular homeostasis: III. The formalism of discrete orbits in ontogeny.Kenneth R. Berger & Edmond A. Murphy - 1989 - Theoretical Medicine and Bioethics 10 (4).
Isomorphisms of splits of computably enumerable sets.Peter A. Cholak & Leo A. Harrington - 2003 - Journal of Symbolic Logic 68 (3):1044-1064.
Spectra and Wavefunctions in a Ray-Splitting Sinai Microwave Billiard and their Semiclassical Interpretation.R. Schäfer, U. Kuhl, M. Barth & H.-J. Stöckmann - 2001 - Foundations of Physics 31 (3):475-487.
Orbits of hyperhypersimple sets and the lattice of ∑03 sets.E. Herrmann - 1983 - Journal of Symbolic Logic 48 (3):693 - 699.
Elliptic Orbits and the Growth of the Third Law with Newton.Philip E. B. Jourdain - 1920 - The Monist 30 (2):183-198.
Isomorphism types of maximal cofinitary groups.Bart Kastermans - 2009 - Bulletin of Symbolic Logic 15 (3):300-319.
Analytics
Added to PP
2014-01-16
Downloads
96 (#545,800)
6 months
17 (#687,833)
2014-01-16
Downloads
96 (#545,800)
6 months
17 (#687,833)
Historical graph of downloads
Citations of this work
-Maximal sets.Peter A. Cholak, Peter Gerdes & Karen Lange - 2015 - Journal of Symbolic Logic 80 (4):1182-1210.
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.
Orbits of computably enumerable sets: low sets can avoid an upper cone.Russell Miller - 2002 - Annals of Pure and Applied Logic 118 (1-2):61-85.
On the Degrees of Diagonal Sets and the Failure of the Analogue of a Theorem of Martin.Keng Meng Ng - 2009 - Notre Dame Journal of Formal Logic 50 (4):469-493.
References found in this work
Classes of Recursively Enumerable Sets and Degrees of Unsolvability.Donald A. Martin - 1966 - Mathematical Logic Quarterly 12 (1):295-310.
Minimal pairs and high recursively enumerable degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
A non-inversion theorem for the jump operator.Richard A. Shore - 1988 - Annals of Pure and Applied Logic 40 (3):277-303.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
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