Related papers: Adding linear orders
Differential Linear Logic enriches Linear Logic with additional logical rules for the exponential connectives, dual to the usual rules of dereliction, weakening and contraction. We present a proof-net syntax for Differential Linear Logic…
We show that several classes of ordered structures (namely, convex linear orders, layered permutations, and compositions) admit first-order logical limit laws.
Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…
Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…
We prove that the category of ordered abelian groups equipped with an automorphism has the Amalgamation Property, deduce that their inductive theory is NIP in the sense of positive logic, and initiate a development of the latter framework.…
We use a localisation technique to study orthogonally additive polynomials on Banach lattices. We derive alternative characterisations for orthogonal additivity of polynomials and orthosymmetry of $m$-linear mappings. We prove that an…
In this paper we introduce the concept of an infinite loop mod $n$ and discuss the properties that these objects have. In particular, we show that a real number $\alpha$ is a counterexample to the $p$-adic Littlewood Conjecture if and only…
We present a linearity theorem for a proof language of intuitionistic multiplicative additive linear logic, incorporating addition and scalar multiplication. The proofs in this language are linear in the algebraic sense. This work is part…
We give an analytic proof of the norm index theorem $[I_:K^* N(I_L)] =[L:K]$ for cyclic extensions of number fields using spectral theory of the idele class group.
We study one way in which stable phenomena can exist in an NIP theory. We start by defining a notion of 'pure instability' that we call 'distality' in which no such phenomenon occurs. O-minimal theories and the p-adics for example are…
A syntactical proof is given that all functions definable in a certain affine linear typed lambda-calculus with iteration in all types are polynomial time computable. The proof provides explicit polynomial bounds that can easily be…
For every closed subset $X$ of a stratifiable [resp. metrizable] space $Y$ we construct a positive linear extension operator $T:R^{X\times X}\to R^{Y\times Y}$ preserving constant functions, bounded functions, continuous functions,…
It was recently shown that arbitrary first-order models canonically extend to models (of the same language) consisting of ultrafilters. The main precursor of this construction was the extension of semigroups to semigroups of ultrafilters, a…
The theory of algebraic extensions of Banach algebras is well established, and there are many constructions which yield interesting extensions. In particular, Cole's method for extending uniform algebras by adding square roots of functions…
Mixed integer linear programming (MILP) is a powerful representation often used to formulate decision-making problems under uncertainty. However, it lacks a natural mechanism to reason about objects, classes of objects, and relations.…
It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…
We present a logic that extends CTL (Computation Tree Logic) with operators that express synchronization properties. A property is synchronized in a system if it holds in all paths of a certain length. The new logic is obtained by using the…
The theme of the first two sections, is to prepare the framework of how from a ``complicated'' family of so called index models $I \in K_1$ we build many and/or complicated structures in a class $K_2$. The index models are…
Given a complete theory $T$ and a subset $Y \subseteq X^k$, we precisely determine the {\em worst case complexity}, with respect to further monadic expansions, of an expansion $(M,Y)$ by $Y$ of a model $M$ of $T$ with universe $X$. In…
The differential $\lambda$-calculus studies how the quantitative aspects of programs correspond to differentiation and to Taylor expansion inside models of linear logic. Recent work has generalized the axioms of Taylor expansion so they…