Archive for Mathematical Logic 40 (8):651-664 (2001)
| Authors |
|
| Abstract |
We investigate Turing cones as sets of reals, and look at the relationship between Turing cones, measures, Baire category and special sets of reals, using these methods to show that Martin's proof of Turing Determinacy (every determined Turing closed set contains a Turing cone or is disjoint from one) does not work when you replace “determined” with “Blackwell determined”. This answers a question of Tony Martin
|
| Keywords | Legacy |
| Categories | (categorize this paper) |
| DOI | 10.1007/s001530100092 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
PhilArchive copy
Upload a copy of this paper Check publisher's policy Papers currently archived: 56,903
External links
- From the Publisher via CrossRef (no proxy)
- citeseerx.ist.psu.edu
(no proxy) - link.springer.com (no proxy)
- link.springer.com [2] (no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
- Sign in / register and customize your OpenURL resolver..
- Configure custom resolver
References found in this work BETA
No references found.
Citations of this work BETA
Turing Invariant Sets and the Perfect Set Property.Clovis Hamel, Haim Horowitz & Saharon Shelah - 2020 - Mathematical Logic Quarterly 66 (2):247-250.
Similar books and articles
Schnorr Trivial Reals: A Construction. [REVIEW]Johanna N. Y. Franklin - 2008 - Archive for Mathematical Logic 46 (7-8):665-678.
Schnorr Randomness.Rodney G. Downey & Evan J. Griffiths - 2004 - Journal of Symbolic Logic 69 (2):533 - 554.
Turing's Golden: How Well Turing's Work Stands Today.Justin Leiber - 2006 - Philosophical Psychology 19 (1):13-46.
Computational Randomness and Lowness.Sebastiaan A. Terwijn & Domenico Zambella - 2001 - Journal of Symbolic Logic 66 (3):1199-1205.
From a Well-Ordering of the Reals It is Easy (by a Diagonal Argument) to Produce a Non-Determined Set of Reals. However, Large Cardinal Axioms Imply That All Sets of Reals in L (R), and More, Are Determined. See, for Example, Neeman's Papers Optimalproofs of Determinacy.Andrzej S. Murawski - 1995 - Bulletin of Symbolic Logic 1:327-339.
Schnorr Triviality and Genericity.Johanna N. Y. Franklin - 2010 - Journal of Symbolic Logic 75 (1):191-207.
Is There a Nonrecursive Decidable Equational Theory?Benjamin Wells - 2002 - Minds and Machines 12 (2):301-324.
Subclasses of the Weakly Random Reals.Johanna N. Y. Franklin - 2010 - Notre Dame Journal of Formal Logic 51 (4):417-426.
Martin’s Conjecture and Strong Ergodicity.Simon Thomas - 2009 - Archive for Mathematical Logic 48 (8):749-759.
Turing Determinacy and the Continuum Hypothesis.Ramez L. Sami - 1989 - Archive for Mathematical Logic 28 (3):149-154.
Analytics
Added to PP index
2013-11-23
Total views
7 ( #1,004,951 of 2,409,419 )
Recent downloads (6 months)
1 ( #540,072 of 2,409,419 )
2013-11-23
Total views
7 ( #1,004,951 of 2,409,419 )
Recent downloads (6 months)
1 ( #540,072 of 2,409,419 )
How can I increase my downloads?
Downloads
