Abstract
Various variants of the concept of the V-realizability for predicate formulas are defined where indices of functions in the set V are used for interpreting the implication and the universal quantifier. It is proved that Markov’s principle is weakly V-realizable, not uniformly V-realizable, and uniformly V-realizable in any V-enumerable domain M ⊆ ℕ.
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.
