- 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
Upper bounds for the arithmetical degrees
Annals of Pure and Applied Logic 29 (3):225-254 (1985)
Abstract
This article has no associated abstract. (fix it)Author's Profile
My notes
Similar books and articles
Minimal Complementation Below Uniform Upper Bounds for the Arithmetical Degrees.Masahiro Kumabe - 1996 - Journal of Symbolic Logic 61 (3):1158-1192.
Minimal complementation below uniform upper Bounds for the arithmetical degrees.Masahiro Kumabe - 1996 - Journal of Symbolic Logic 61 (4):1158-1192.
Low upper bounds in the LR degrees.David Diamondstone - 2012 - Annals of Pure and Applied Logic 163 (3):314-320.
Stability of recursive structures in arithmetical degrees.C. J. Ash - 1986 - Annals of Pure and Applied Logic 32:113-135.
Upper bounds on ideals in the computably enumerable Turing degrees.George Barmpalias & André Nies - 2011 - Annals of Pure and Applied Logic 162 (6):465-473.
Minimal upper Bounds for arithmetical degrees.Masahiro Kumabe - 1994 - Journal of Symbolic Logic 59 (2):516-528.
Ash, CJ, Stability of recursive structures in arithmetical degrees Ash, CJ, Categoric@ in hyperarithmetical degrees.D. Cenzer, P. Clote, R. L. Smith, S. S. Wainer, K. J. Compton, C. W. Henson & S. Shelah - 1988 - Annals of Pure and Applied Logic 40:307-310.
On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis.Andre Scedrov - 1986 - Annals of Pure and Applied Logic 32:291-297.
Martin’s Axiom and embeddings of upper semi-lattices into the Turing degrees.Wang Wei - 2010 - Annals of Pure and Applied Logic 161 (10):1291-1298.
On arithmetical completeness of the logic of proofs.Sohei Iwata & Taishi Kurahashi - 2019 - Annals of Pure and Applied Logic 170 (2):163-179.
Analytics
Added to PP
2013-10-30
Downloads
20 (#760,329)
6 months
4 (#1,006,434)
2013-10-30
Downloads
20 (#760,329)
6 months
4 (#1,006,434)
Historical graph of downloads
Author's Profile
Citations of this work
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 upper Bounds for arithmetical degrees.Masahiro Kumabe - 1994 - Journal of Symbolic Logic 59 (2):516-528.
Completions of PA: Models and Enumerations of Representable Sets.Alex M. McAllister - 1998 - Journal of Symbolic Logic 63 (3):1063-1082.
1998–99 Annual Meeting of the Association for Symbolic Logic.Sam Buss - 1999 - Bulletin of Symbolic Logic 5 (3):395-421.
Minimal complementation below uniform upper Bounds for the arithmetical degrees.Masahiro Kumabe - 1996 - Journal of Symbolic Logic 61 (4):1158-1192.
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.
A degree-theoretic definition of the ramified analytical hierarchy.Carl G. Jockusch & Stephen G. Simpson - 1976 - Annals of Mathematical Logic 10 (1):1-32.
Double Jumps of Minimal Degrees.Carl G. Jockusch & David B. Posner - 1978 - Journal of Symbolic Logic 43 (4):715 - 724.
Minimal degrees and the jump operator.S. B. Cooper - 1973 - Journal of Symbolic Logic 38 (2):249-271.
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-6686886f5-2nz2h uwo