Related papers: Model-theoretic applications of cofinality spectru…
Although the CSP (constraint satisfaction problem) is NP-complete, even in the case when all constraints are binary, certain classes of instances are tractable. We study classes of instances defined by excluding subproblems. This approach…
We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…
The back-and-forth relations $M\leq_\alpha N$ are central to computable structure theory and countable model theory. It is well-known that the relation $\{(M,N) : M \leq_\alpha N\}$ is (lightface) $\Pi^0_{2\alpha}$. We show that this is…
We survey discrete and continuous model-theoretic notions which have important connections to general topology. We present a self-contained exposition of several interactions between continuous logic and $C_p$-theory which have applications…
Conventional ordering transitions, described by the Landau paradigm, are characterized by the symmetries broken at the critical point. Within the constrained manifold occurring at low temperatures in certain frustrated systems,…
We prove the existence of resolution of singularities for arbitrary (not necessarily reduced or irreducible) excellent two-dimensional schemes, via permissible blow-ups. The resolution is canonical, and functorial with respect to…
A subset of a model of ${\sf PA}$ is called neutral if it does not change the $\mathrm{dcl}$ relation. A model with undefinable neutral classes is called neutrally expandable. We study the existence and non-existence of neutral sets in…
We introduce a 2-round stochastic constraint-satisfaction problem, and show that its approximation version is complete for (the promise version of) the complexity class AM. This gives a `PCP characterization' of AM analogous to the PCP…
We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…
We present a general variational framework for the training of freeform nonlinearities in layered computational architectures subject to some slope constraints. The regularization that we add to the traditional training loss penalizes the…
The class of problems complete for NP via first-order reductions is known to be characterized by existential second-order sentences of a fixed form. All such sentences are built around the so-called generalized IS-form of the sentence that…
We describe the E-infinity algebra structure on the complex of singular cochains of a topological space, in the context of sheaf theory. As a first application, for any algebraic variety we define a weight filtration compatible with its…
The sigma model on complex projective superspaces CP^{S-1|S} gives rise to a continuous family of interacting 2D conformal field theories which are parametrized by the curvature radius R and the theta angle \theta. Our main goal is to…
General mathematical reasoning is computationally undecidable, but humans routinely solve new problems. Moreover, discoveries developed over centuries are taught to subsequent generations quickly. What structure enables this, and how might…
We prove existence and up to the boundary regularity estimates in $L^{p}$ and H\"{o}lder spaces for weak solutions of the linear system $$ \delta \left( A d\omega \right) + B^{T}d\delta \left( B\omega \right) = \lambda B\omega + f \text{ in…
The uniform one-dimensional fragment U1 is a recently introduced extension of the two-variable fragment FO2. The logic U1 enables the use of relation symbols of all arities and thereby extends the scope of applications of FO2. In this…
A fundamental theorem of linear programming states that a feasible linear program is solvable if and only if its objective function is copositive with respect to the recession cone of its feasible set. This paper demonstrates that this…
Let $\Omega$ be a bounded domain in $\mathbb R^{N}$, $N\geq3$ with smooth boundary, $a>0, \lambda>0$ and $0<\delta<3$ be real numbers. Define $2^*:=\displaystyle\frac{2N}{N-2}$ and the characteristic function of a set $A$ by $\chi_A$. We…
We present two different types of models where, for certain singular cardinals lambda of uncountable cofinality, lambda -> (lambda, omega+1)^2, although lambda is not a strong limit cardinal. We announce, here, and will present in a…
We consider two CSP problems: the first CSP encodes 2D Sperner's lemma for the standard triangulation of the right triangle on $n^2$ small triangles; the second CSP encodes the fact that it is impossible to match cells of $n \times n$…