Add to ORKGProof uses forcing on perfect trees for 2-quantifier sentences in the language of arithmetic. The result extends to exact pairs for the hyperarithmetic degrees
We introduce the concept of perfect pairs of trees of a graph as a natural generalization of so-call...
Two non-adjacent vertices in a graph form an even pair if every chordless path between them has an ...
International audienceA Turing degree d bounds a principle P of reverse mathematics if every computa...
Proof uses forcing on perfect trees for 2-quantifier sentences in the language of arithmetic. The re...
Abstract In the paper the exact pair theorem for the ω-enumeration degrees is proved. As a corollary...
A (Turing) ideal I is a downward closed set of Turing degrees which is also closed under the supremu...
AbstractWe show that the elementary theory of the recursively enumerable tt-degrees has the same com...
International audienceThe tree theorem for pairs (TT 2 2), first introduced by Chubb, Hirst, and McN...
Abstract. We show that every nonzero ∆ 0 2 e-degree bounds a minimal pair. On the other hand, there ...
In the paper, we provide an alternative and united proof of a double in-equality for bounding the ar...
We define a formalism, forbidden pairs problems, in which many combinatorial constructions can be ex...
Abstract. We show that if A and B form a nontrivial K-pair, then there is a semi-computable set C su...
Two sets of 0-1 vectors of fixed length form a uniquely decodeable code pair if their Cartesian prod...
Abstract. We determine the exact minimum ℓ-degree threshold for perfect matchings in k-uniform hyper...
Two sets of 0-1 vectors of fixed length form a uniquely decodeable code pair if their Cartesian prod...
We introduce the concept of perfect pairs of trees of a graph as a natural generalization of so-call...
Two non-adjacent vertices in a graph form an even pair if every chordless path between them has an ...
International audienceA Turing degree d bounds a principle P of reverse mathematics if every computa...
Proof uses forcing on perfect trees for 2-quantifier sentences in the language of arithmetic. The re...
Abstract In the paper the exact pair theorem for the ω-enumeration degrees is proved. As a corollary...
A (Turing) ideal I is a downward closed set of Turing degrees which is also closed under the supremu...
AbstractWe show that the elementary theory of the recursively enumerable tt-degrees has the same com...
International audienceThe tree theorem for pairs (TT 2 2), first introduced by Chubb, Hirst, and McN...
Abstract. We show that every nonzero ∆ 0 2 e-degree bounds a minimal pair. On the other hand, there ...
In the paper, we provide an alternative and united proof of a double in-equality for bounding the ar...
We define a formalism, forbidden pairs problems, in which many combinatorial constructions can be ex...
Abstract. We show that if A and B form a nontrivial K-pair, then there is a semi-computable set C su...
Two sets of 0-1 vectors of fixed length form a uniquely decodeable code pair if their Cartesian prod...
Abstract. We determine the exact minimum ℓ-degree threshold for perfect matchings in k-uniform hyper...
Two sets of 0-1 vectors of fixed length form a uniquely decodeable code pair if their Cartesian prod...
We introduce the concept of perfect pairs of trees of a graph as a natural generalization of so-call...
Two non-adjacent vertices in a graph form an even pair if every chordless path between them has an ...
International audienceA Turing degree d bounds a principle P of reverse mathematics if every computa...