DOIAbstract
Abstract. We present a notion of forcing that can be used, in conjunction with other results, to show that there is a Martin-Löf random set X such that X 6≥T ∅ ′ and X computes every K-trivial set. 1
Abstract. We present a notion of forcing that can be used, in conjunction with other results, to show that there is a Martin-Löf random set X such that X 6≥T ∅ ′ and X computes every K-trivial set. 1
Abstract. Let Y ∈ ∆0 2 be Martin-Löf-random. Then there is a promptly simple set A such that, for ea...
Abstract. There is an infinite subset of a Martin-Löf random set of integers that does not compute ...
International audienceWe give two new characterizations of K-triviality. We show that if for all Y s...
We show that a Martin-Löf random set for which the effective version of the Lebesgue density theorem...
Abstract. Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Marti...
Abstract. Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Marti...
AbstractIn [3], Brodhead, Downey and Ng introduced some new variations of the notions of being Marti...
grantor: University of TorontoWe study the influence of the fundamental forcing notions, C...
We investigate Martin’s game (as described in Arruda et al. (Eds.), On Random R. E
AbstractIn this article I will analyze the impact of forcing with a measure algebra on various topol...
Abstract. This article presents an algebraic topology perspective on the problem of finding a comple...
In this paper we introduce a tree-like forcing notion extending some properties of the random forcin...
AbstractWe investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, No...
This article presents an algebraic topology perspective on the problem of finding a complete coverag...
Abstract. A set B ⊆ N is called low for Martin-Löf random if every Martin-Löf random set is also M...
Abstract. Let Y ∈ ∆0 2 be Martin-Löf-random. Then there is a promptly simple set A such that, for ea...
Abstract. There is an infinite subset of a Martin-Löf random set of integers that does not compute ...
International audienceWe give two new characterizations of K-triviality. We show that if for all Y s...
We show that a Martin-Löf random set for which the effective version of the Lebesgue density theorem...
Abstract. Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Marti...
Abstract. Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Marti...
AbstractIn [3], Brodhead, Downey and Ng introduced some new variations of the notions of being Marti...
grantor: University of TorontoWe study the influence of the fundamental forcing notions, C...
We investigate Martin’s game (as described in Arruda et al. (Eds.), On Random R. E
AbstractIn this article I will analyze the impact of forcing with a measure algebra on various topol...
Abstract. This article presents an algebraic topology perspective on the problem of finding a comple...
In this paper we introduce a tree-like forcing notion extending some properties of the random forcin...
AbstractWe investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, No...
This article presents an algebraic topology perspective on the problem of finding a complete coverag...
Abstract. A set B ⊆ N is called low for Martin-Löf random if every Martin-Löf random set is also M...
Abstract. Let Y ∈ ∆0 2 be Martin-Löf-random. Then there is a promptly simple set A such that, for ea...
Abstract. There is an infinite subset of a Martin-Löf random set of integers that does not compute ...
International audienceWe give two new characterizations of K-triviality. We show that if for all Y s...
Add to ORKG