English
Related papers

Related papers: Constructing Wadge classes

200 papers

We give a new and effective classification of all Borel Wadge classes of subsets of Baire space. This relies on the true stage machinery originally developed by Montalb\'an. We use this machinery to give a new proof of Louveau and…

Logic · Mathematics 2022-11-16 Adam Day , Noam Greenberg , Matthew Harrison-Trainor , Dan Turetsky

All spaces are assumed to be separable and metrizable. We give a complete classification of the zero-dimensional homogeneous spaces, under the Axiom of Determinacy. This classification is expressed in terms of topological complexity (in the…

General Topology · Mathematics 2025-10-24 Andrea Medini

We want to give a construction as simple as possible of a Borel subset of a product of two Polish spaces. This introduces the notion of potential Wadge class. Among other things, we study the non-potentially closed sets, by proving…

Logic · Mathematics 2007-10-02 Dominique Lecomte

We show that if $\mathcal{F}$ is any "well-behaved" subset of the Borel functions and we assume the Axiom of Determinacy then the hierarchy of degrees on $\pow(\mathbb{R})$ induced by $\mathcal{F}$ turns out to look like the Wadge hierarchy…

Logic · Mathematics 2010-03-25 Luca Motto Ros

We give, for each non self-dual Wadge class C contained in the class of the Gdelta sets, a characterization of Borel sets which are not potentially in C, among Borel sets with countable vertical sections; to do this, we use results of…

Logic · Mathematics 2007-10-02 Dominique Lecomte

All spaces are assumed to be separable and metrizable. We show that, assuming the Axiom of Determinacy, every zero-dimensional homogeneous space is strongly homogeneous (that is, all its non-empty clopen subspaces are homeomorphic), with…

General Topology · Mathematics 2020-03-03 Raphaël Carroy , Andrea Medini , Sandra Müller

We give a framework to produce constructible functions from natural functors between categories, without need of a morphism of moduli spaces to model the functor. We show using the Riemann-Hilbert correspondence that any natural (derived)…

Algebraic Geometry · Mathematics 2021-10-18 Nero Budur , Botong Wang

In his dissertation, Wadge defined a notion of guessability on subsets of the Baire space and gave two characterizations of guessable sets. A set is guessable iff it is in the second ambiguous class (boldface Delta^0_2), iff it is…

Logic · Mathematics 2016-06-08 Samuel Alexander

In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…

Logic · Mathematics 2008-01-15 Arnold W. Miller

The set-theoretic axiom WISC states that for every set there is a set of surjections to it cofinal in all such surjections. By constructing an unbounded topos over the category of sets and using an extension of the internal logic of a topos…

Category Theory · Mathematics 2015-08-27 David Michael Roberts

For each prime number $p$ and each integer $g \geqslant 5$, we construct infinitely many abelian varieties of dimension $g$ over $\overline{\mathbb{F}}_p$ satisfying the standard conjecture of Hodge type. The main tool is a recent theorem…

Algebraic Geometry · Mathematics 2025-11-14 Thomas Agugliaro

Using the Feferman-Vaught Theorem, we prove that a definable subset of a product structure must be a Boolean combination of open sets, in the product topology induced by giving each factor structure the discrete topology. We prove a…

Logic · Mathematics 2018-12-10 Alice Medvedev , Alexander Van Abel

We investigate the relationship between axiomatic set theory and the first-order theory of homeomorphism groups of manifolds in the language of group theory, concentrating on first-order rigidity and type versus conjugacy. We prove that…

Geometric Topology · Mathematics 2025-12-08 James E. Hanson , Thomas Koberda , J. de la Nuez González , Christian Rosendal

The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_\sigma$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof…

Logic · Mathematics 2026-03-10 Sven Manthe

Deconstructibility is an often-used sufficient condition on a class $\mathcal{C}$ of modules that allows one to carry out homological algebra \emph{relative to $\mathcal{C}$}. The principle \textbf{Maximum Deconstructibility (MD)} asserts…

Logic · Mathematics 2025-05-23 Sean Cox

We develop a theory of k-partitions of the set of infinite words recognizable by classes of finite automata. The theory enables to complete proofs of existing results about topological classifications of the (aperiodic) omega-regular…

Combinatorics · Mathematics 2021-04-22 Victor Selivanov

We generalize Franz' independence in tensor categories with inclusions from two morphisms (which represent generalized random variables) to arbitrary ordered families of morphisms. We will see that this only works consistently if the unit…

Category Theory · Mathematics 2022-10-11 Malte Gerhold , Stephanie Lachs , Michael Schürmann

This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…

Logic in Computer Science · Computer Science 2016-11-14 Cyril Cohen , Thierry Coquand , Simon Huber , Anders Mörtberg

By a theorem of Chevalley the image of a morphism of varieties is a constructible set. The algebraic version of this fact is usually stated as a result on "extension of specializations" or "lifting of prime ideals". We present a difference…

Commutative Algebra · Mathematics 2010-10-26 Michael Wibmer

In this article we provide effective characterisations of regular languages of infinite trees that belong to the low levels of the Wadge hierarchy. More precisely we prove decidability for each of the finite levels of the hierarchy; for the…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Mikołaj Bojańczyk , Filippo Cavallari , Thomas Place , Michał Skrzypczak
‹ Prev 1 2 3 10 Next ›