Abstract
We show that there is a computable procedure which, given an ∀∃-sentence \({\varphi}\) in the language of the partially ordered sets with a top element 1 and a bottom element 0, computes whether \({\varphi}\) is true in the Medvedev degrees of \({\Pi^0_1}\) classes in Cantor space, sometimes denoted by \({\mathcal{P}_s}\) .
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.
