2 search results - page 1 / 1 » A Cappable Almost Everywhere Dominating Computably Enumerabl... |
ENTCS
2007
13 years 4 months ago
2007
We show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair.
ICCS
2003
Springer
13 years 10 months ago
2003
Springer
The paper presents a theory for modeling flow in anisotropic, viscous rock. This theory has originally been developed for the simulation of large deformation processes including t...