Related papers: Mutual Interpretability of Weak Essentially Undeci…
This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by…
In the context of continuous first-order logic, special attention is often given to theories that are somehow continuous in an 'essential' way. A common feature of such theories is that they do not interpret any infinite discrete…
We introduce Joint Probability Trees (JPT), a novel approach that makes learning of and reasoning about joint probability distributions tractable for practical applications. JPTs support both symbolic and subsymbolic variables in a single…
In this paper we describe an approach to constraint-based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order (MSO) logic are represented by tree automata recognizing the…
We present a bounded modified realisability and a bounded functional interpretation of intuitionistic nonstandard arithmetic with nonstandard principles. The functional interpretation is the intuitionistic counterpart of Ferreira and…
This paper from 2000 is a presentation of a status qu{\ae}stionis at that tiime, to wit of the problem of the interpretability logic of {\em all}\/ reasonable arithmetical theories. We present both the arithmetical side and the modal side…
The tree metric theorem provides a combinatorial four point condition that characterizes dissimilarity maps derived from pairwise compatible split systems. A similar (but weaker) four point condition characterizes dissimilarity maps derived…
Weighted monadic second-order logic is a weighted extension of monadic second-order logic that captures exactly the behaviour of weighted automata. Its semantics is parameterized with respect to a semiring on which the values that weighted…
Can scientific discovery be made arbitrarily easy by choosing the right representation, collecting enough data, and deploying sufficiently powerful algorithms? This paper argues that the answer is fundamentally negative. We introduce the…
Nicholas Pippenger and Kristin Schleich have recently given a combinatorial interpretation for the second-order super-Catalan numbers (u_{n})_{n>=0}=(3,2,3,6,14,36,...): they count "aligned cubic trees" on n internal vertices. Here we give…
Altenbernd, Thomas and W\"ohrle have considered acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with usual acceptance conditions, such as the B\"uchi and Muller ones [1]. It was proved…
We establish a framework for the study of the effective theory of weak convergence of measures. We define two effective notions of weak convergence of measures on $\mathbb{R}$: one uniform and one non-uniform. We show that these notions are…
As artificial intelligence is increasingly affecting all parts of society and life, there is growing recognition that human interpretability of machine learning models is important. It is often argued that accuracy or other similar…
We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory $T$ is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model $M$ of $T$ has an expansion…
We describe heterotic string and M-theory realizations of the Randall-Sundrum (RS) scenario with $\cx N=2$ and $\cx N=1$ supersymmetry in the bulk. Supersymmetry can be broken only on the world brane, a scenario that has been proposed to…
The tangent number $T_{2n+1}$ is equal to the number of increasing labelled complete binary trees with $2n+1$ vertices. This combinatorial interpretation immediately proves that $T_{2n+1}$ is divisible by $2^n$. However, a stronger…
We investigate the fundamental group of Griffiths' space, and the first singular homology group of this space and of the Hawaiian Earring by using (countable) reduced tame words. We prove that two such words represent the same element in…
We adapt the hypercube decompositions introduced by Blundell-Buesing-Davies-Veli\v{c}kovi\'{c}-Williamson to prove the Combinatorial Invariance Conjecture for Kazhdan-Lusztig $R$-polynomials in the case of elementary intervals in $S_n$.…
We consider injective first-order interpretations that input and output trees of bounded height. The corresponding functions have polynomial output size, since a first-order interpretation can use a k-tuple of input nodes to represent a…
Four-particle tree-level scattering amplitudes in string theory are magically consistent with unitarity, reflected in the non-trivial fact that beneath the critical dimension, the residues of the amplitudes on massive poles can be expanded…