The following pages link to (Q4946099):
Displayed 18 items.
- On arithmetical level of the class of superhigh sets (Q465108) (← links)
- Approximations of optimal control problems for semilinear elliptic equations with discontinuous coefficients and states and with controls in the coefficients multiplying the highest derivatives (Q519126) (← links)
- On strongly jump traceable reals (Q925851) (← links)
- Turing degrees of reals of positive effective packing dimension (Q975475) (← links)
- Consistent convergence rate estimates in the grid \(W_{2,0}^2(\omega)\) norm for difference schemes approximating nonlinear elliptic equations with mixed derivatives and solutions from \(W_{2,0}^m(\Omega)\), \(3 < m \leq 4\) (Q1687798) (← links)
- Maximal pairs of computably enumerable sets in the computably Lipschitz degrees (Q1946505) (← links)
- Fixed-point selection functions (Q2030128) (← links)
- Limitwise monotonic spectra and their generalizations (Q2117781) (← links)
- Integer valued betting strategies and Turing degrees (Q2353410) (← links)
- Three Theorems on n-REA Degrees: Proof-Readers and Verifiers (Q3091436) (← links)
- STRONG JUMP-TRACEABILITY (Q4580033) (← links)
- A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES (Q4637942) (← links)
- Trivial Reals (Q4916182) (← links)
- Nonlowness is independent from fickleness (Q5037206) (← links)
- Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees (Q5189151) (← links)
- Array nonrecursiveness and relative recursive enumerability (Q5388716) (← links)
- CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES (Q5858920) (← links)
- Maximality and collapse in the hierarchy of α-c.a. degrees (Q5859843) (← links)