- 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
Π11‐Martin‐Löf randomness and Π11‐Solovay completeness
Mathematical Logic Quarterly 65 (3):265-279 (2019)
Abstract
Developing an analogue of Solovay reducibility in the higher recursion setting, we show that results from the classical computably enumerable case can be extended to the new context.Other Versions
No versions found
My notes
Similar books and articles
The difference between optimality and universality.Kenshi Miyabe - 2012 - Logic Journal of the IGPL 20 (1):222-234.
Computably enumerable sets below random sets.André Nies - 2012 - Annals of Pure and Applied Logic 163 (11):1596-1610.
Continuous higher randomness.Laurent Bienvenu, Noam Greenberg & Benoit Monin - 2017 - Journal of Mathematical Logic 17 (1):1750004.
The computable Lipschitz degrees of computably enumerable sets are not dense.Adam R. Day - 2010 - Annals of Pure and Applied Logic 161 (12):1588-1602.
Arithmetical Measure.Sebastiaan A. Terwijn & Leen Torenvliet - 1998 - Mathematical Logic Quarterly 44 (2):277-286.
Algorithmic randomness over general spaces.Kenshi Miyabe - 2014 - Mathematical Logic Quarterly 60 (3):184-204.
Minimal weak truth table degrees and computably enumerable Turing degrees.R. G. Downey - 2020 - Providence, RI: American Mathematical Society. Edited by Keng Meng Ng & Reed Solomon.
Degrees of Monotone Complexity.William C. Calhoun - 2006 - Journal of Symbolic Logic 71 (4):1327 - 1341.
On the Π1 1 -separation principle.Antonio Montalbán - 2008 - Mathematical Logic Quarterly 54 (6):563-578.
Analytics
Added to PP
2019-10-18
Downloads
10 (#1,477,106)
6 months
3 (#1,481,767)
2019-10-18
Downloads
10 (#1,477,106)
6 months
3 (#1,481,767)
Historical graph of downloads
References found in this work
Algorithmic randomness and complexity. Theory and Applications of Computability.Rodney G. Downey & Denis R. Hirschfeldt - 2012 - Bulletin of Symbolic Logic 18 (1):126-128.
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-667477cd97-lv8mh dc2