Related papers: A note on drastic product logic
Differential linear logic (DiLL) provides a fine analysis of resource consumption in cut-elimination. We investigate the subsystem of DiLL without promotion in a deep inference formalism, where cuts are at an atomic level. In our system…
Following the lines of the analysis done in [BPZ07, BCF07] for first-order G\"odel logics, we present an analogous investigation for Nilpotent Minimum logic NM. We study decidability and reciprocal inclusion of various sets of first-order…
We study the notion of dp-minimality, beginning by providing several essential facts, establishing several equivalent definitions, and comparing dp-minimality to other minimality notions. The rest of the paper is dedicated to examples. We…
Weighted logic programming, a generalization of bottom-up logic programming, is a well-suited framework for specifying dynamic programming algorithms. In this setting, proofs correspond to the algorithm's output space, such as a path…
We introduce the dynamic comparison property for minimal dynamical systems which has applications to the study of crossed product C*-algebras. We demonstrate that this property holds for a large class of systems which includes all examples…
Let $G$ be a finite group and $D_{2n}$ be the dihedral group of $2n$ elements. For a positive integer $d$, let $\mathsf{s}_{d\mathbb{N}}(G)$ denote the smallest integer $\ell\in \mathbb{N}_0\cup \{+\infty\}$ such that every sequence $S$…
While there is a long tradition of reasoning about (non)termination in program analysis, specialized logics are typically needed to give different termination criteria. This includes partial correctness, where termination is not guaranteed,…
Dynamic logic is a modal logic for reasoning about programs. A cyclic proof system is a proof system that allows proofs containing cycles and is an alternative to a proof system containing (co-)induction. This paper introduces a sequent…
Discounting the influence of future events is a key paradigm in economics and it is widely used in computer-science models, such as games, Markov decision processes (MDPs), reinforcement learning, and automata. While a single game or MDP…
We present a bisequent calculus (BSC) for the minimal theory of definite descriptions (DD) in the setting of neutral free logic, where formulae with non-denoting terms have no truth value. The treatment of quantifiers, atomic formulae and…
The (prefix-free) Kolmogorov complexity of a finite binary string is the length of the shortest description of the string. This gives rise to some `standard' lowness notions for reals: A is K-trivial if its initial segments have the lowest…
In the standard sequent presentations of Girard's Linear Logic (LL), there are two "non-decreasing" rules, where the premises are not smaller than the conclusion, namely the cut and the contraction rules. It is a universal concern to…
We review product form blocking measures in the general framework of nearest neighbor asymmetric one dimensional misanthrope processes. This class includes exclusion, zero range, bricklayers, and many other models. We characterize the cases…
If G is a countable discrete group acting linearly on a finite-dimensional vector space over any topological field, then the groups of coboundaries are closed for the product topology in all degrees, and hence the cohomology is reduced in…
In this paper, we consider a temporal logic planning problem in which the objective is to find an infinite trajectory that satisfies an optimal selection from a set of soft specifications expressed in linear temporal logic (LTL) while…
For a continuous action $G\curvearrowright X$ of a countable group on a compact metrizable space we show that the following are equivalent: (i) the action $G\curvearrowright X$ has the small boundary property and no finite orbits, (ii) for…
The von Neumann algebra free product of arbitary finite dimensional von Neumann algebras with respect to arbitrary faithful states, at least one of which is not a trace, is found to be a type~III factor possibly direct sum a finite…
We obtain a duality between certain category of finite MTL-algebras and the category of finite labeled trees. In addition we prove that certain poset products of MTL-algebras are essentialy sheaves of MTL-chains over Alexandrov spaces.…
We generalize the classical Tanaka result on the finiteness of symmetry algebra for non-degenerate pseudo-product structures to the case when the completely-integrable distributions defining the pseudo-product structure are no longer…
We define centrally large subalgebras of simple unital C*-algebras, strengthening the definition of large subalgebras in previous work. We prove that if A is any infinite dimensional simple separable unital C*-algebra which contains a…