Abstract
The relationship between the Axiom of Determinacy (AD) and the Axiom of Turing Determinacy has been open for over 50 years, and the attempts to understand that relationship has had a profound influence on Set Theory in a variety of ways. The prevailing conjecture is that these two determinacy hypotheses are actually equivalent, and the main theorem of this paper is that Turing Determinacy implies that every Suslin set is determined.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
