Related papers: Trois couleurs: A new non-equational theory
The causal structure of Einstein's evolution equations is considered. We show that in general they can be written as a first order system of balance laws for any choice of slicing or shift. We also show how certain terms in the evolution…
We study $\varepsilon$-stability in continuous logic. We first consider stability in a model, where we obtain a definability of types result with a better approximation than that in the literature. We also prove forking symmetry for…
Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…
Let $(\Omega, \leq)$ be a totally ordered set. We prove that if $\Aut(\Omega,\leq)$ is transitive and satisfies the same first-order sentences as $\Aut(\RR,\leq)$ (in the language of lattice-ordered groups) then $\Omega$ and $\RR$ are…
Coloured Alexander polynomials form a sequence of non-semisimple quantum invariants coming from the representation theory of the quantum group $U_q(sl(2))$ at roots of unity. This sequence recovers the original Alexander polynomial as the…
It is a well known empirical observation that natural axiomatic theories are pre-well-ordered by consistency strength. For any natural theory $T$, the next strongest natural theory is $T+\mathsf{Con}_T$. We formulate and prove a statement…
We report the first experimental realization of pattern formation in a spatially extended nonlinear system when the system is alternated between two states, neither of which exhibits patterning. Dynamical equations modeling the system are…
A vertex colouring of a graph $G$ is "nonrepetitive" if $G$ contains no path for which the first half of the path is assigned the same sequence of colours as the second half. Thue's famous theorem says that every path is nonrepetitively…
We show that for every non-spherical set $X$ in $\mathbb{E}^d$, there exists a natural number $m$ and a red/blue-colouring of $\mathbb{E}^n$ for every $n$ such that there is no red copy of X and no blue progression of length $m$ with each…
The paper deals with two issues: the existence of universal models of a theory T and related properties when cardinal arithmetic does not give this existence offhand. In the first section we prove that simple theories (e.g., theories…
Suppose that each number $1,2,...,N$ has one of n colours assigned. We show that if there are no monochromatic solutions to the equation $x_1+x_2+x_3=y_1+y_2$, then $N=O((n!)^{1/2})$, improving upon a result of Cwalina and Schoen. Further,…
On relating the three primary colors namely red, green and blue with a triplet representation of the non-abelian group $SU(3)$, it is established that the three secondary and six tertiary colors along with two neutral colors transform as…
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…
A new infinite family of examples of finite non-bicolorable configurations of rays in Hilbert space is described. Such configurations appear in the analysis of quantum mechanics in terms of Bell's inequalities and Kochen-Specker theorem and…
We consider the question of determining whether or not a given system of fractional-order differential equations is (asymptotically) stable. In particular, we admit systems where each constituent equation may have its own order, independent…
A new class of noncommutative $k$-algebras (for $k$ an algebraically closed field) is defined and shown to contain some important examples of quantum groups. To each such algebra, a first order theory is assigned describing models of a…
We propose a new calculus SCL(EQ) for first-order logic with equality that only learns non-redundant clauses. Following the idea of CDCL (Conflict Driven Clause Learning) and SCL (Clause Learning from Simple Models) a ground literal model…
A $(c_1,c_2,...,c_k)$-coloring of $G$ is a mapping $\varphi:V(G)\mapsto\{1,2,...,k\}$ such that for every $i,1 \leq i \leq k$, $G[V_i]$ has maximum degree at most $c_i$, where $G[V_i]$ denotes the subgraph induced by the vertices colored…
A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…
We extend the definition of $n$-dimensional difference equations to complex order $\alpha\in \mathbb{C} $. We investigate the stability of linear systems defined by an $n$-dimensional matrix $A$ and derive conditions for the stability of…