2020
DOI: 10.48550/arxiv.2002.10712
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Degrees of incomputability, realizability and constructive reverse mathematics

Abstract: There is a way of assigning a realizability notion to each degree of incomputability. In our setting, we make use of Weihrauch degrees (degrees of incomputability/discontinuity of partial multi-valued functions) to obtain Lifschitz-like relative realizability predicates. In this note, we present sample examples on how to lift some separation results on Weihrauch degrees to those over intuitionistic Zermelo-Fraenkel set theory IZF.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(17 citation statements)
references
References 24 publications
0
17
0
Order By: Relevance
“…However, the three algebras mentioned above are the main ones used in applications in this section (although many natural and important examples of relative PCAs are known; see e.g. [37,18] and also Section 4.2). For now, let us proceed with the above three algebras in mind.…”
Section: 1mentioning
confidence: 99%
See 1 more Smart Citation
“…However, the three algebras mentioned above are the main ones used in applications in this section (although many natural and important examples of relative PCAs are known; see e.g. [37,18] and also Section 4.2). For now, let us proceed with the above three algebras in mind.…”
Section: 1mentioning
confidence: 99%
“…This third approach has been taken by the author [19], for example, and is formulated using topos-theoretic notions such as Lawvere-Tierney topology. This approach also originates from the author's attempt [18] to develop a handy proof method to separate non-constructive principles in constructive reverse mathematics (i.e., reverse mathematics based on intuitionistic logic; see [9,10]).…”
mentioning
confidence: 99%
“…A similar notion for partial multifunctions on N N has been extensively studied, e.g. in [19,29,16,42,21,15], and is known as generalized Weihrauch reducibility. Indeed, Turing reducibility in the above sense is exactly the restriction of generalized Weihrauch reducibility to functions on N.…”
Section: Game Rulesmentioning
confidence: 99%
“…Proof. The proof is by a typical recursion trick; see [21]. Suppose for the sake of contradiction that there exists a winning Arthur-Nimue strategy (τ | η) witnessing LLPO 1/ ≤ LT Error 1/ +2 .…”
Section: 2mentioning
confidence: 99%
See 1 more Smart Citation