Related papers: Inexpressibility in Exp-Minus-Log
We establish decidability for the infinitely many axiomatic extensions of the commutative Full Lambek logic with weakening FLew (i.e. IMALLW) that have a cut-free hypersequent proof calculus (specifically: every analytic structural rule…
We obtain complete characterizations of the Unique Bipartite Perfect Matching function, and of its Boolean dual, using multilinear polynomials over the reals. Building on previous results, we show that, surprisingly, the dual description is…
A reduced word of a permutation $w$ is a minimal length expression of $w$ as a product of simple transpositions. We examine the computational complexity, formulas and (randomized) algorithms for their enumeration. In particular, we prove…
The inverse-free extreme learning machine (ELM) algorithm proposed in [4] was based on an inverse-free algorithm to compute the regularized pseudo-inverse, which was deduced from an inverse-free recursive algorithm to update the inverse of…
We introduce an automata model for data words, that is words that carry at each position a symbol from a finite alphabet and a value from an unbounded data domain. The model is (semantically) a restriction of data automata, introduced by…
This paper introduces the exponential substitution calculus (ESC), a new presentation of cut elimination for IMELL, based on proof terms and building on the idea that exponentials can be seen as explicit substitutions. The idea in itself is…
In this paper, we introduce a new four-parameter generalization of the exponentiated Weibull (EW) distribution, called the exponentiated Weibull-logarithmic (EWL) distribution, which obtained by compounding EW and logarithmic distributions.…
This paper is devoted to the study of the low Mach number limit for the 2D isentropic Euler system associated to ill-prepared initial data with slow blow up rate on $\log\varepsilon^{-1}$. We prove in particular the strong convergence to…
We investigate the computational power of periodically iterated morphisms, also known as D0L systems with periodic control, PD0L systems for short. These systems give rise to a class of one-sided infinite sequences, called PD0L words. We…
It was shown recently by Ars\'enio and the author that the two-dimensional incompressible Euler--Maxwell system is globally well-posed in the Yudovich class, provided that the electromagnetic field enjoys appropriate conditions, including…
It is well known that MTL with integer endpoints is unable to express all of monadic first-order logic of order and metric (FO(<,+1)). Indeed, MTL is unable to express the counting modalities $C_n$ that assert a properties holds $n$ times…
We introduce the class of \emph{Log-Noetherian} (LN) functions. These are holomorphic solutions to algebraic differential equations (in several variables) with logarithmic singularities. We prove an upper bound on the number of solutions…
Lov\'asz Local Lemma (LLL) is a probabilistic tool that allows us to prove the existence of combinatorial objects in the cases when standard probabilistic argument does not work (there are many partly independent conditions). LLL can be…
We conjecture that the logarithm of the absolute value of the constant in the functional equation of the Hasse-Weil L-function of a variety X over Z is equal to a certain Arakelov de Rham Euler characteristic of X. This generalizes the fact…
The paper presents the derivation of the asymptotic behavior of $\nu$-zeros of the modified Bessel function of imaginary order $K_{{\rm i}\nu}(z)$. This derivation is based on the quasiclassical treatment of the exponential potential on the…
A seminal result of Kamp is that over the reals Linear Temporal Logic (LTL) has the same expressive power as first-order logic with binary order relation < and monadic predicates. A key question is whether there exists an analogue of Kamp's…
We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…
We propose an algebraic model of computation which formally relates symbolic listings, complexity of Boolean functions, and low depth arithmetic circuit complexity. In this model algorithms are arithmetic formula expressing symbolic…
The use of exponentials in linear logic greatly enhances its expressive power. In this paper we focus on nonassociative noncommutative multiplicative linear logic, and systematically explore modal axioms K, T, and 4 as well as the…
A prototype system is described whose core functionality is, based on propositional logic, the elimination of second-order operators, such as Boolean quantifiers and operators for projection, forgetting and circumscription. This approach…