Related papers: Models for the Displacement Calculus
The basic disentanglement theorem established by the present authors states that estimates on a weighted geometric mean over (convex) families of functions can be disentangled into quantitatively linked estimates on each family separately.…
We obtain a derivative formula for various notions of capacity. Namely we identify the second order term in the asymptotic expansion of the capacity of a union of two sets, as their distance goes to infinity. Our result applies to the usual…
We show that the deletion theorem of a free arrangement is combinatorial, i.e., whether we can delete a hyperplane from a free arrangement keeping freeness depends only on the intersection lattice. In fact, we give an explicit sufficient…
We introduce labelled sequent calculi for the basic normal non-distributive modal logic L and 31 of its axiomatic extensions, where the labels are atomic formulas of a first order language which is interpreted on the canonical extensions of…
The algebraic $\lambda$-calculus is an extension of the ordinary $\lambda$-calculus with linear combinations of terms. We establish that two ordinary $\lambda$-terms are equivalent in the algebraic $\lambda$-calculus iff they are…
We study a continuum model of dislocation transport in order to investigate the formation of heterogeneous dislocation patterns. We propose a physical mechanism which relates the formation of heterogeneous patterns to the dynamics of a…
In this paper, we introduce an alternative method for applying averaging theory of orders $1$ and $2$ in the plane. This is done by combining Taylor expansions of the displacement map with the integral form of the…
A d.c. (delta-convex) function on a normed linear space is a function representable as a difference of two continuous convex functions. We show that an infinite dimensional analogue of Hartman's theorem on stability of d.c. functions under…
The main purpose of this review is to summarize the recent advances of the Conservation-Dissipation Formalism (CDF), a new way for constructing both thermodynamically compatible and mathematically stable and well-posed models for…
The preferential conditional logic PCL, introduced by Burgess, and its extensions are studied. First, a natural semantics based on neighbourhood models, which generalise Lewis' sphere models for counterfactual logics, is proposed. Soundness…
We study three kinds of compactness in some variants of G\"odel logic: compactness, entailment compactness, and approximate entailment compactness. For countable first-order underlying language we use the Henkin construction to prove the…
Concept-based explanations have emerged as a popular way of extracting human-interpretable representations from deep discriminative models. At the same time, the disentanglement learning literature has focused on extracting similar…
Distributed representations (such as those based on embeddings) and discrete representations (such as those based on logic) have complementary strengths. We explore one possible approach to combining these two kinds of representations. We…
We call an algebra $A$ commutator-simple if $[A,A]$ does not contain nonzero ideals of $A$. After providing several examples, we show that in these algebras derivations are determined by a condition that is applicable to the study of local…
Let ${\cal F}\_\lambda(S^1)$ be the space of tensor densities of degree (or weight) $\lambda$ on the circle $S^1$. The space ${\cal D}^k\_{\lambda,\mu}(S^1)$ of $k$-th order linear differential operators from ${\cal F}\_\lambda(S^1)$ to…
A new notion of displacement convexity on a matrix level is developed for density flows arising from mean-field games, compressible Euler equations, entropic interpolation, and semi-classical limits of non-linear Schr\"odinger equations.…
Cylindrical Algebraic Decompositions (CADs) endowed with additional topological properties have found applications beyond their original logical setting, including algorithmic optimizations in CAD construction, robot motion planning, and…
A non-deterministic call-by-need lambda-calculus \calc with case, constructors, letrec and a (non-deterministic) erratic choice, based on rewriting rules is investigated. A standard reduction is defined as a variant of left-most outermost…
Description logics (DLs) are well-known knowledge representation formalisms focused on the representation of terminological knowledge. Due to their first-order semantics, these languages (in their classical form) are not suitable for…
This text gives a rough, but linear summary covering some key definitions, notations, and propositions from Lambda Calculus: Its Syntax and Semantics, the classical monograph by Barendregt. First, we define a theory of untyped extensional…