相关论文: On the Topological Complexity of Infinitary Ration…

We prove in this paper that there exists some infinitary rational relations which are Sigma^0_3-complete Borel sets and some others which are Pi^0_3-complete. This implies that there exists some infinitary rational relations which are…

We address some fundamental problems concerning the structure of idealistic equivalence relations. In particular, we show that, under analytic determinacy, there are continuum many idealistic analytic equivalence relations that are not…

We consider the set of infinite real traces, over a dependence alphabet (Gamma, D) with no isolated letter, equipped with the topology induced by the prefix metric. We then prove that all rational languages of infinite real traces are…

We consider a large family of theories of equivalence relations, each with finitely many classes, and assuming the existence of an $\omega$-Erdos cardinal, we determine which of these theories are Borel complete. We develop machinery,…

We consider the complexity of special $\alpha$-limit sets, a kind of backward limit set for non-invertible dynamical systems. We show that these sets are always analytic, but not necessarily Borel, even in the case of a surjective map on…

We prove that if $\leq$ is an analytic partial order then either $\leq$ can be extended to a (boldface) $\Delta^1_2$ linear order similar to an antichain in $2^{<\omega_1}$ ordered lexicographically or a certain Borel partial order $\leq_0$…

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite then the complexity of hyperfinite countable Borel equivalence relations is as high as possible, namely,…

This paper is a continuation of the study of topological properties of omega context free languages (omega-CFL). We proved before that the class of omega-CFL exhausts the hierarchy of Borel sets of finite rank, and that there exist some…

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…

We give in this paper additional answers to questions of Lescow and Thomas [Logical Specifications of Infinite Computations, In:"A Decade of Concurrency", Springer LNCS 803 (1994), 583-621], proving new topological properties of omega…

We give in this paper an example of infinitary rational relation, accepted by a 2-tape B\"{u}chi automaton, which is Pi^0_3-complete in the Borel hierarchy. Moreover the example of infinitary rational relation given in this paper has a very…

We give axiomatic foundations for non-finitary infinite matroids with duality, in terms of independent sets, bases, circuits, closure and rank. This completes the solution to a problem of Rado of 1966.

We show that, from the topological point of view, 2-tape B\"uchi automata have the same accepting power as Turing machines equipped with a B\"uchi acceptance condition. The Borel and the Wadge hierarchies of the class RAT_omega of…

We show that, consistently, there is a Borel set which has uncountably many pairwise very non-disjoint translations, but does not allow a perfect set of such translations.

Except for a limited number of cases, a complete classification of the Diophantine sets of polynomial rings and fields of rational functions seems out of reach at present. We contribute to this problem by proving that several natural sets…

We give conditions on a finite set of series of rational numbers to ensure that they are algebraically independent. Specialising our results to polynomials of lower degree, we also obtain new results on irrationality and $mathbb{Q}$-linear…

We prove the following surprising result: there exist a 1-counter B\"uchi automaton and a 2-tape B\"uchi automaton such that the \omega-language of the first and the infinitary rational relation of the second in one model of ZFC are…

In this paper we complete the attempt of H. Lefmann to show that Borel equivalence relations on the $n$-element subsets of $2^{\omega}$, that respect an order type, have a finite Ramsey basis.

Given an analytic equivalence relation, we tend to wonder whether it is Borel. When it is non Borel, there is always the hope it will be Borel on a "large" set -- nonmeager or of positive measure. That has led Kanovei, Sabok and Zapletal to…

We prove that topological isomorphism on procountable groups is not classifiable by countable structures, in the sense of descriptive set theory. In fact, the equivalence relation $\ell_\infty$ expressing that two sequences of reals have a…