- 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
Uniform Upper Bounds on Ideals of Turing Degrees
Journal of Symbolic Logic 43 (3):601-612 (1978)
Abstract
This article has no associated abstract. (fix it)Author's Profile
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
On computable automorphisms of the rational numbers.A. S. Morozov & J. K. Truss - 2001 - Journal of Symbolic Logic 66 (3):1458-1470.
Jumping to a Uniform Upper Bound.Harold T. Hodes - 1982 - Proceedings of the American Mathematical Society 85 (4):600-602.
Upper bounds on locally countable admissible initial segments of a Turing degree hierarchy.Harold T. Hodes - 1981 - Journal of Symbolic Logic 46 (4):753-760.
Models of arithmetic and upper Bounds for arithmetic sets.Alistair H. Lachlan & Robert I. Soare - 1994 - Journal of Symbolic Logic 59 (3):977-983.
Minimal complementation below uniform upper Bounds for the arithmetical degrees.Masahiro Kumabe - 1996 - Journal of Symbolic Logic 61 (4):1158-1192.
An Exact Pair for the Arithmetic Degrees Whose Join is Not a Weak Uniform Upper Bound.Harold T. Hodes - 1982 - Recursive Function Theory-Newsletters 28.
A Minimal Upper Bound on a Sequence of Turing Degrees Which Represents that Sequence.Harold T. Hodes - 1983 - Pacific Journal of Mathematics 108 (1):115-119.
Eventually infinite time Turing machine degrees: Infinite time decidable reals.P. D. Welch - 2000 - Journal of Symbolic Logic 65 (3):1193-1203.
More about uniform upper Bounds on ideals of Turing degrees.Harold T. Hodes - 1983 - Journal of Symbolic Logic 48 (2):441-457.
Analytics
Added to PP
2009-01-28
Downloads
318 (#63,731)
6 months
121 (#32,702)
2009-01-28
Downloads
318 (#63,731)
6 months
121 (#32,702)
Historical graph of downloads
Author's Profile
Citations of this work
Upper bounds for the arithmetical degrees.M. Lerman - 1985 - Annals of Pure and Applied Logic 29 (3):225-254.
Jumping through the transfinite: The master code hierarchy of Turing degrees.Harold T. Hodes - 1980 - Journal of Symbolic Logic 45 (2):204-220.
More about uniform upper Bounds on ideals of Turing degrees.Harold T. Hodes - 1983 - Journal of Symbolic Logic 48 (2):441-457.
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge, Mass.: MIT Press.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
A degree-theoretic definition of the ramified analytical hierarchy.Carl G. Jockusch & Stephen G. Simpson - 1976 - Annals of Mathematical Logic 10 (1):1-32.
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