Related papers: A note on drastic product logic

We consider the call-by-value lambda-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent…

Our concern is the axiomatisation problem for modal and algebraic logics that correspond to various fragments of two-variable first-order logic with counting quantifiers. In particular, we consider modal products with Diff, the…

Every definite logic program has as its meaning a least Herbrand model with respect to the program-independent ordering "set-inclusion". In the case of normal logic programs there do not exist least models in general. However, according to…

A discrete group $\Gamma$ is called exact if the reduced group C*-algebra ${C_{\lambda}}^{*}(\Gamma)$ is exact as C*-algebras, and a discrete group $\Lambda$ is called residually exact if every nonunital element $g \in \Lambda$ admits a…

To each discrete product system E of finite-dimensional Hilbert spaces we associate a C*-algebra O_E. When E is the n-dimensional product system over N, O_E is the Cuntz algebra O_n, and the irrational rotation algebras appear as O_E for…

Let $G$ be a multiplicative finite group and $S=a_1\cdot\ldots\cdot a_k$ a sequence over $G$. We call $S$ a product-one sequence if $1=\prod_{i=1}^ka_{\tau(i)}$ holds for some permutation $\tau$ of $\{1,\ldots,k\}$. The small Davenport…

For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smaller than the minimum distance of C. Schwartz and Vardy…

Let C be a separable unital C*-algebra, not isomorphic to the complex numbers, equipped with a faithful tracial state. Let A be a unital direct limit of one dimensional NCCW complexes, also equipped with a faithful tracial state. Suppose…

A weight module of a basic Lie superalgebra is called finite if all of its weight spaces are finite dimensional, and it is called bounded if there is a uniform bound on the dimension of a weight space. The minimum bound is called the degree…

For each natural number $n$ we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than $n$ and no strictly ascending chains. The case $n=0$ is the G\"odel-L\"ob…

The target discounted-sum problem is the following: Given a rational discount factor $0<\lambda<1$ and three rational values $a,b$, and $t$, does there exist a finite or an infinite sequence $w \in \{a,b\}^*$ or $w \in \{a,b\}^\omega$, such…

We consider the asymmetric simple exclusion process (ASEP) on $\mathbb{Z}$ with an initial data such that in the large time particle density $\rho(\cdot)$ a discontinuity at the origin is created, where the value of $\rho$ jumps from zero…

We characterise stable finiteness and pure infiniteness of the essential crossed product of a C*-algebra by an action of an inverse semigroup. Under additional assumptions, we prove a stably finite / purely infinite dichotomy. Our main…

We study reinforcement learning for episodic Markov Decision Processes (MDPs) whose transitions are modelled by a multinomial logistic (MNL) model. Existing algorithms for MNL mixture MDPs yield a regret of $\smash{\tilde{O}(dH^2\sqrt{T})}$…

Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first argument does not suffice to determine the value of the expression. In programming, short-circuit…

Minimal Dark Matter (MDM) is a theoretical framework highly appreciated for its minimality and yet its predictivity. Of the two only viable candidates singled out in the original analysis, the scalar eptaplet has been found to decay too…

We first recall some basic notions on minimalist grammars and on categorial grammars. Next we shortly introduce partially commutative linear logic, and our representation of minimalist grammars within this categorial system, the so-called…

Formal mathematics and computer science proofs are formalized using Hilbert-Russell-style logical systems which are designed to not admit paradoxes and self-refencing reasoning. These logical systems are natural way to describe and reason…

We reformulate the definition of a zero product determined algebra in terms of tensor products and obtain necessary and sufficient conditions for an algebra to be zero product determined. These conditions allow us to prove that the direct…

Let $\F$ be a collection of subsets of $\Z_+$ and $(X,T)$ be a dynamical system. $x\in X$ is $\F$-recurrent if for each neighborhood $U$ of $x$, $\{n\in\Z_+:T^n x\in U\}\in \F$. $x$ is $\F$-product recurrent if $(x,y)$ is recurrent for any…