Related papers: Trois couleurs: A new non-equational theory
A colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the second half. We show that planar graphs have nonrepetitive…
In Team Semantics, a dependency notion is strongly first order if every sentence of the logic obtained by adding the corresponding atoms to First Order Logic is equivalent to some first order sentence. In this work it is shown that all…
Conventional Ramsey-theoretic investigations for edge-colourings of complete graphs are framed around avoidance of certain configurations. Motivated by considerations arising in the field of Qualitative Reasoning, we explore edge colourings…
This paper discusses the formalization of proofs "by diagram chasing", a standard technique for proving properties in abelian categories. We discuss how the essence of diagram chases can be captured by a simple many-sorted first-order…
The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are non-null in a…
In this paper we give characterizations of the super-stable theories, in terms of an external property called representation. In the sense of the representation property, the mentioned class of first-order theories can be regarded as "not…
We study the $\kappa$-Borel-reducibility of isomorphism relations of complete first order theories by using coloured trees. Under some cardinality assumptions, we show the following: For all theories T and T', if T is classifiable and T' is…
We determine the limiting dynamics of a fermionic condensate following a sudden perturbation for various initial conditions. We demonstrate that possible initial states of the condensate fall into two classes. In the first case, the order…
In a series of papers starting in [Sel01] and culminating in [Sel07], Z. Sela proved that free groups, and more generally torsion-free hyperbolic groups, have a stable first-order theory. The question of the stability of the free product of…
We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…
The spectrum of a first-order logic sentence is the set of natural numbers that are cardinalities of its finite models. In this paper we study the hierarchy of first-order spectra based on the number of variables. It has been conjectured…
We present the first example of a phase transition in a nonequilibrium steady-state that can be argued analytically to be first order. The system of interest is a two-species reaction-diffusion problem whose control parameter is the total…
We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…
A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence…
It is a well-known empirical phenomenon that natural axiomatic theories are pre-well-ordered by consistency strength. Without a precise mathematical definition of "natural," it is unclear how to study this phenomenon mathematically. We will…
We study a class of evolutionary partial differential systems with two components related to second order (in time) non-evolutionary equations of odd order in spatial variable. We develop the formal diagonalisation method in symbolic…
A graph class $\mathscr{C}$ is called monadically stable if one cannot interpret, in first-order logic, arbitrary large linear orders in colored graphs from $\mathscr{C}$. We prove that the model checking problem for first-order logic is…
A new approach to the stochastic theory of turbulence is suggested. The coloured noise that is present in the stochastic Navier-Stokes equation is generated from the delta-correlated noise allowing us to avoid the nonlocal field theory as…
In Euclidean Ramsey Theory usually we are looking for monochromatic configurations in the Euclidean space, whose points are colored with a fixed number of colors. In the canonical version, the number of colors is arbitrary, and we are…
A system of chromodynamic fields, which can be treated as classical, is generated at the earliest stage of relativistic heavy-ion collisions. Numerical simulations show that the system is unstable but the nature of the instability is not…