Related papers: Borel Reductions and Cub Games in Generalized Desc…

We introduce the notion of feedback computable functions from $2^\omega$ to $2^\omega$, extending feedback Turing computation in analogy with the standard notion of computability for functions from $2^\omega$ to $2^\omega$. We then show…

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…

Let $(X_n,d_n),\,n\in\Bbb N$ be a sequence of pseudo-metric spaces, $p\ge 1$. For $x,y\in\prod_{n\in\Bbb N}X_n$, let $(x,y)\in E((X_n)_{n\in\Bbb N};p)\Leftrightarrow\sum_{n\in\Bbb N}d_n(x(n),y(n))^p<+\infty$. For Borel reducibility between…

Assuming an instance of the Brodsky-Rinot proxy principle holding at a regular uncountable cardinal $\kappa$, we construct $2^\kappa$-many pairwise non-embeddable minimal non-$\sigma$-scattered linear orders of size $\kappa$. In particular,…

We develop a compositional framework for generalized reversible computing using copy-discard categories and resource theories. We introduce partitioned matrices between partitioned sets as subdistribution matrices which preserve the…

We define and study expansion problems on countable structures in the setting of descriptive combinatorics. We consider both expansions on countable Borel equivalence relations and on countable groups, in the Borel, measure and category…

We firstly show that due to their resplendency ordered henselian valued fields admit relative field quantifier elimination in the Denef--Pas language expanded by linear orders in the field and residue field sort. Secondly, we deduce from a…

We define the notion of a determined Borel code in reverse math, and consider the principle $DPB$, which states that every determined Borel set has the property of Baire. We show that this principle is strictly weaker than $ATR$. Any…

We introduce an analog to the notion of Polish space for spaces of weight $\leq\kappa$, where $\kappa$ is an uncountable regular cardinal such that $\kappa^{<\kappa}=\kappa$. Specifically, we consider spaces in which player II has a winning…

We continue the work of [1, 2, 3] by analyzing the equivalence relation of bi-embeddability on various classes of countable planes, most notably the class of countable non-Desarguesian projective planes. We use constructions of the second…

This paper deals with the reducibility property of semidirect products of the form $\bf V*\bf D$ relatively to graph equation systems, where $\bf D$ denotes the pseudovariety of definite semigroups. We show that, if the pseudovariety $\bf…

We consider positively supported Borel measures for which all moments exist. On the set of compactly supported measures in this class a partial order is defined via eventual dominance of the moment sequences. Special classes are identified…

We demonstrate that the technology of Radin forcing can be used to transfer compactness properties at a weakly inaccessible but not strong limit cardinal to a strongly inaccessible cardinal. As an application, relative to the existence of…

Let $\Gamma$ be a countable group. A classical theorem of Thorisson states that if $X$ is a standard Borel $\Gamma$-space and $\mu$ and $\nu$ are Borel probability measures on $X$ which agree on every $\Gamma$-invariant subset, then $\mu$…

Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…

We consider a class of second order ordinary differential equations describing one-dimensional systems with a quasi-periodic analytic forcing term and in the presence of damping. As a physical application one can think of a…

We consider countable Borel equivalence relations on quotient Borel spaces. We prove a generalization of the Feldman-Moore representation theorem, but provide some examples showing that other very simple properties of countable equivalence…

We establish the Borel computability of various C$^*$-algebra invariants, including the Elliott invariant and the Cuntz semigroup. As applications we deduce that AF algebras are classifiable by countable structures, and that a conjecture of…

We systematically develop analogs of basic concepts from classical descriptive set theory in the context of pointless topology. Our starting point is to take the elements of the free complete Boolean algebra generated by the frame…

A new technique named Generalized Borel Transform (GBT) is applied to the generating functional of the $\Phi^{4}$ theory in zero dimensions with degenerate minima. The analytical solution of this function, obtained in the non perturbative…