1 citations · 1 across the 3 of their papers we have counts for
4 papers
Some complete -powers of a one-counter language in the difference hierarchy
Jacques Duparc, Olivier Finkel, Dominique Lecomte
Fix a finite alphabet having at least two letters, and natural numbers . We denote by the class of differences of subsets of the Cantor space…
The Wadge order on the Scott domain is not a well-quasi-order
Jacques Duparc, Louis Vuilleumier
We prove that the Wadge order on the Borel subsets of the Scott domain is not a well-quasi-order, and that this feature even occurs among the sets of Borel rank at most 2. For this…
Easy Proofs of Löwenheim-Skolem Theorems by Means of Evaluation Games
Jacques Duparc
We propose a proof of the downward Löwenheim-Skolem that relies on strategies deriving from evaluation games instead of the Skolem normal forms. This proof is simpler, and easily u…
An omega-power of a context-free language which is Borel above Delta^0_omega
Jacques Duparc, Olivier Finkel
We use erasers-like basic operations on words to construct a set that is both Borel and above Delta^0_omega, built as a set V^ωwhere V is a language of finite words accepted by a p…