共查询到20条相似文献,搜索用时 264 毫秒
1.
Zhidong Pan 《Linear algebra and its applications》2012,436(11):4251-4260
2.
We study computably enumerable equivalence relations (or, ceers), under computable reducibility ≤, and the halting jump operation on ceers. We show that every jump is uniform join-irreducible, and thus join-irreducible. Therefore, the uniform join of two incomparable ceers is not equivalent to any jump. On the other hand there exist ceers that are not equivalent to jumps, but are uniform join-irreducible: in fact above any non-universal ceer there is a ceer which is not equivalent to a jump, and is uniform join-irreducible. We also study transfinite iterations of the jump operation. If a is an ordinal notation, and E is a ceer, then let denote the ceer obtained by transfinitely iterating the jump on E along the path of ordinal notations up to a. In contrast with what happens for the Turing jump and Turing reducibility, where if a set X is an upper bound for the A-arithmetical sets then computes , we show that there is a ceer R such that , for every finite ordinal n, but, for all k, (here Id is the identity equivalence relation). We show that if are notations of the same ordinal less than , then , but there are notations of such that and are incomparable. Moreover, there is no non-universal ceer which is an upper bound for all the ceers of the form where a is a notation for . 相似文献
3.
4.
Dennis I. Merino 《Linear algebra and its applications》2012,436(7):1960-1968
5.
6.
7.
8.
9.
10.
11.
12.
Let R be an associative ring with unit and denote by the homotopy category of complexes of projective left R-modules. Neeman proved the theorem that is -compactly generated, with the category of left bounded complexes of finitely generated projective R-modules providing an essentially small class of such generators. Another proof of Neeman's theorem is explained, using recent ideas of Christensen and Holm, and Emmanouil. The strategy of the proof is to show that every complex in vanishes in the Bousfield localization . 相似文献
13.
14.
15.
16.
17.
18.
19.