Related papers: A note on drastic product logic
This article discusses modelling of the tail of a multivariate distribution function by means of a large deviation principle (LDP), and its application to the estimation of the probability of a multivariate extreme event from a sample of n…
In this paper we consider the topological products of modal logics of S4.1 and S4. We prove that it is equal to the fusion of logics S4.1 and S4 plus one additional axiom. We also show that this product is decidable. This is an example of a…
We introduce a weighted linear dynamic logic (weighted LDL for short) and show the expressive equivalence of its formulas to weighted rational expressions. This adds a new characterization for recognizable series to the fundamental…
In the Minimum Description Length (MDL) principle, learning from the data is equivalent to an optimal coding problem. We show that the codes that achieve optimal compression in MDL are critical in a very precise sense. First, when they are…
Following up on previous work, we prove a number of results for C*-algebras with the weak ideal property or topological dimension zero, and some results for C*-algebras with related properties. Some of the more important results include:…
A labelled Markov decision process (MDP) is a labelled Markov chain with nondeterminism; i.e., together with a strategy a labelled MDP induces a labelled Markov chain. The model is related to interval Markov chains. Motivated by…
Considering classical first-order logic with equality, we give a "fully syntactic" construction of the (weak) syntactic category $\text{Syn}(T)$ associated to a consistent theory $T$; we show it is a consistent coherent category; and we…
We propose a new version of generalized probabilistic propositional logic, namely, discrete-continuous logic (DCL) in which every generalized proposition (GP) is represented as 2x2 nondiagonal positive matrix with unit trace. We demonstrate…
The Central Limit Theorem (CLT) establishes that sufficiently large sequences of independent and identically distributed random variables converge in probability to a normal distribution. This makes the CLT a fundamental building block of…
A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calculus, of grammar logics with converse, i.e., every modal…
The classical Baldwin-Lachlan characterization of uncountably categorical theories is known to fail in continuous logic in that not every inseparably categorical theory has a strongly minimal set. Here we investigate these issues by…
A skeleton of the category with finite coproducts D freely generated by a single object has a subcategory isomorphic to a skeleton of the category with finite products C freely generated by a countable set of objects. As a consequence, we…
We show that the noncommutative residue density, resp. the cut-off regularised integral are the only closed linear, resp. continuous closed linear forms on certain classes of symbols. This leads to alternative proofs of the uniqueness of…
We classify the weak*-closed maximal left ideals of the measure algebra $M(G)$ for certain Hermitian locally compact groups $G$ in terms of the irreducible representations of $G$ and their asymptotic properties. In particular, we obtain a…
We present nested sequent systems for propositional G\"odel-Dummett logic and its first-order extensions with non-constant and constant domains, built atop nested calculi for intuitionistic logics. To obtain nested systems for these…
Doust and Weston introduced a new method called "enhanced negative type" for calculating a non trivial lower bound p(T) on the supremal strict p-negative type of any given finite metric tree (T,d). In the context of finite metric trees any…
Termination analysis of linear loops plays a key r\^{o}le in several areas of computer science, including program verification and abstract interpretation. Already for the simplest variants of linear loops the question of termination…
Ultrafinitism postulates that we can only compute on relatively short objects, and numbers beyond certain value are not available. This approach would also forbid many forms of infinitary reasoning and allow to remove certain paradoxes…
Let $A$ be a $d \times d$ matrix with rational entries which has no eigenvalue $\lambda \in \mathbb{C}$ of absolute value $|\lambda| < 1$ and let $\mathbb{Z}^d[A]$ be the smallest nontrivial $A$-invariant $\mathbb{Z}$-module. We lay down a…
In this short paper we will discuss the similarities and differences between two semantic approaches to modal logics - non-deterministic semantics and restricted non-deterministic semantics. Generally speaking, both kinds of semantics are…