Related papers: On First-Order Definable Colorings

The paper aims to establish a convenient formal framework for investigating the phenomenon of scheme definiteness, exemplified by first-order internal categoricity as studied by V\"a\"an\"anen, among others. To this end, we introduce the…

Characteristic class relations in Dolbeault cohomology follow from the existence of a holomorphic geometric structure (for example, holomorphic conformal structures, holomorphic Engel distributions, holomorphic projective connections, and…

In this note we give a generalization for the higher order Hochschild cohomology and show that the secondary Hochschild cohomology is a particular case of this new construction.

Given an ordered structure, we study a natural way to extend the order to preorders on type spaces. For definably complete, linearly ordered structures, we give a characterisation of the preorder on the space of 1-types. We apply these…

From a logical point of view, Stone duality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models…

We study the complexity of a class of promise graph homomorphism problems. For a fixed graph H, the H-colouring problem is to decide whether a given graph has a homomorphism to H. By a result of Hell and Ne\v{s}et\v{r}il, this problem is…

We consider the two-variable fragment of first-order logic with one distinguished binary predicate constrained to be interpreted as a transitive relation. The finite satisfiability problem for this logic is shown to be decidable, in triply…

We consider the first-order theory of random variables with the probabilistic independence relation, which concerns statements consisting of random variables, the probabilistic independence symbol, logical operators, and existential and…

Arrangements of pseudolines are a widely studied generalization of line arrangements. They are defined as a finite family of infinite curves in the Euclidean plane, any two of which intersect at exactly one point. One can state various…

Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For example, Downey and Fellow's W-hierarchy is of this form. But…

We introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both…

We provide a first-order homogenization result for quadratic functionals. In particular, we identify the scaling of the energy and the explicit form of the limiting functional in terms of the first-order correctors. The main novelty of the…

Exactly solving first-order constraints (i.e., first-order formulas over a certain predefined structure) can be a very hard, or even undecidable problem. In continuous structures like the real numbers it is promising to compute approximate…

We show that several classes of ordered structures (namely, convex linear orders, layered permutations, and compositions) admit first-order logical limit laws.

Correspondence homomorphisms are both a generalization of standard homomorphisms and a generalization of correspondence colourings. For a fixed target graph $H$, the problem is to decide whether an input graph $G$, with each edge labeled by…

We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…

We investigate the partial orderings of the form (P(X),\subset), where X is a relational structure and P(X) the set of the domains of its isomorphic substructures. A rough classification of countable binary structures corresponding to the…

We study a natural hierarchy in first-order logic, namely the quantifier structure hierarchy, which gives a systematic classification of first-order formulas based on structural quantifier resource. We define a variant of…

We construct a configuration space model for a particular 2-colored differential graded operad encoding the structure of two $A_\infty$ algebras with two $A_\infty$ morphisms and a homotopy between the morphisms. The cohomology of this…

We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the…