Related papers: On Various Negative Translations
The Poincar\'e group can be interpreted as the group of isometries of a minkowskian space. This point of view suggests to consider the group of isometries of a given space as the suitable group to construct a gauge theory of gravity. We…
We obtain algebraic characterizations of relative notions of size in a discrete semigroup that generalize the usual combinatorial notions of syndetic, thick, and piecewise syndetic sets. "Filtered" syndetic and piecewise syndetic sets were…
We consider a modal logic that can formalise statements about uncertainty and beliefs such as `I think that my wallet is in the drawer rather than elsewhere' or `I am confused whether my appointment is on Monday or Tuesday'. To do that, we…
Lattices defined as modules over algebraic rings or orders have garnered interest recently, particularly in the fields of cryptography and coding theory. Whilst there exist many attempts to generalise the conditions for LLL reduction to…
We prove that the Losev--Manin compactification of the space of configurations of $n$ points on ${\mathbb P}^1 \backslash \{0,\infty\}$ modulo scaling degenerates (isotrivially) to a compactification of the space of configurations of $n$…
This paper aims to provide an analysis of what it means when we say that a pair of theories, very generously construed, are equivalent in the sense that they are interdefinable. With regard to theories articulated in first order logic, we…
We show that classical and quantum Kolmogorov complexity of binary strings agree up to an additive constant. Both complexities are defined as the minimal length of any (classical resp. quantum) computer program that outputs the…
The monad of convex sets of probability distributions is a well-known tool for modelling the combination of nondeterministic and probabilistic computational effects. In this work we lift this monad from the category of sets to the category…
The Clifford algebra, generated by the real (Majorana) gamma-matrices and by a hermitian gamma_5, gives room to the reductive Lie algebra u(2,2) of the conformal group extended by the u(1) helicity operator. Its unitary positive energy…
Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of…
Qualitative relationships illustrate how changing one property (e.g., moving velocity) affects another (e.g., kinetic energy) and constitutes a considerable portion of textual knowledge. Current approaches use either semantic parsers to…
Gradual semantics with abstract argumentation provide each argument with a score reflecting its acceptability, i.e. how "much" it is attacked by other arguments. Many different gradual semantics have been proposed in the literature, each…
This paper investigates the proof-theoretic foundations of double negation introduction (DNI) and double negation elimination (DNE) in classical logic. By examining both sequent calculus and natural deduction, it is shown that these rules…
Contramodules are module-like algebraic structures endowed with infinite summation (or, occasionally, integration) operations satisfying natural axioms. Introduced originally by Eilenberg and Moore in 1965 in the case of coalgebras over…
The study of convex functions - in particular, of their optimization (really minimization) is one of the most important fields of applied mathematics. Convexity seems to be one of those incredibly well-chosen hypotheses which is just…
Continuous word representations learned separately on distinct languages can be aligned so that their words become comparable in a common space. Existing works typically solve a least-square regression problem to learn a rotation aligning a…
Some mathematical aspects of using the translation group as an internal symmetry group in a gauge field theory are presented and discussed. The traditional manner in which gravitation can be accounted for by the introduction of a global…
Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with better parameters than explicit constructions do. But the probabilistic…
We present a comparative study of two methods for the reduction of the dimensionality of a system of ordinary differential equations that exhibits time-scale separation. Both methods lead to a reduced system of stochastic differential…
We argue, at a very basic effective field theory level, that higher dimension operators in scalar theories that break symmetries at scales close to their ultraviolet completion cutoff, include terms that favour the breaking of translation…