49 search results - page 4 / 10 » apal 2006 |
APAL
2006
13 years 5 months ago
2006
Abstract. We show that the identity bounded Turing degrees of computably enumerable sets are not dense.
APAL
2006
13 years 5 months ago
2006
ence in Finitary Abstract Elementary Classes Tapani Hyttinen and Meeri Kes
APAL
2006
13 years 5 months ago
2006
Parameterized complexity has, so far, been largely con ned to consideration of computational problems as decision or search problems. However, it is becoming evident that the param...
APAL
2006
13 years 5 months ago
2006
For a long time people have been trying to develop probability theory starting from `finite' events rather than collections of infinite events. In this way one can find natura...
APAL
2006
13 years 5 months ago
2006
The paper shows elimination of imaginaries for real closed valued fields to the geometric sorts which were introduced in the [6]. We also show that this result is in some sense op...