scientific article; zbMATH DE number 1421074
From MaRDI portal
Publication:4946099
zbMath0951.03036MaRDI QIDQ4946099
Publication date: 7 June 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Nonlowness is independent from fickleness ⋮ STRONG JUMP-TRACEABILITY ⋮ 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\) ⋮ Maximal pairs of computably enumerable sets in the computably Lipschitz degrees ⋮ On arithmetical level of the class of superhigh sets ⋮ On strongly jump traceable reals ⋮ Array nonrecursiveness and relative recursive enumerability ⋮ A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES ⋮ Approximations of optimal control problems for semilinear elliptic equations with discontinuous coefficients and states and with controls in the coefficients multiplying the highest derivatives ⋮ Trivial Reals ⋮ Turing degrees of reals of positive effective packing dimension ⋮ Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees ⋮ Fixed-point selection functions ⋮ Three Theorems on n-REA Degrees: Proof-Readers and Verifiers ⋮ CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES ⋮ Maximality and collapse in the hierarchy of α-c.a. degrees ⋮ Integer valued betting strategies and Turing degrees ⋮ Limitwise monotonic spectra and their generalizations
