Related papers: A note on drastic product logic
The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category $\mathcal D$. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the…
Cut-elimination is the bedrock of proof theory with a multitude of applications from computational interpretations to proof analysis. It is also the starting point for important meta-theoretical investigations including decidability,…
In this paper we discuss the relationship between direct products of monounary algebras and their components, with respect to the properties of residual finiteness, strong/weak subalgebra separability, and complete separability. For each of…
We study strongly graded vertex algebras and their strongly graded modules, which are conformal vertex algebras and their modules with a second, compatible grading by an abelian group satisfying certain grading restriction conditions. We…
This paper explores the restriction behavior of silting-induced $t$-structures and co-$t$-structures on triangulated categories endowed with metrics. For compactly generated triangulated categories admitting small coproducts, silting…
This paper explores the theoretical limits of using discrete abstractions for nonlinear control synthesis. More specifically, we consider the problem of deciding continuous-time control with temporal logic specifications. We prove that…
In [Ban97] a connection among rough sets (in particular, pre-rough algebras) and three-valued {\L}ukasiewicz logic {\L}3 is pointed out. In this paper we present a temporal like semantics for Nilpotent Minimum logic NM ([Fod95, EG01]), in…
This paper studies the asymptotic product of two metric spaces. It is well defined if one of the spaces is visual or if both spaces are geodesic. In this case the asymptotic product is the pullback of a limit diagram in the coarse category.…
Let $X$ be a finitely generated left module over a left artinian ring $R$, and let $p(X)=\{l_i\}$ be the infinite sequence of nonnegative integers where $l_i$ is the length of the $i$-th term of the minimal projective resolution of $X$. We…
Let $G$ be a finite group, $A$ a unital separable finite simple nuclear C*-algebra, and $\alpha$ an action of $G$ on $A$. Assume that $A$ absorbs the Jiang-Su algebra $\mathcal{Z}$, the extremal boundary of the trace space of $A$ is compact…
The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lovasz to determine the Shannon capacity of the pentagon; to show a direct sum theorem for…
We give a domain-theoretic semantics to a statistical programming language, using the plain old category of dcpos, in contrast to some more sophisticated recent proposals. Remarkably, our monad of minimal valuations is commutative, which…
Let $X$ be an infinite compact metric space with finite covering dimension and let $\alpha, \beta : X\to X$ be two minimal homeomorphisms. We prove that the crossed product $C^*$-algebras $C(X)\rtimes_\alpha\Z$ and $C(X)\rtimes_\belta\Z$…
A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…
There exist NIP and non-NTP$_2$ theories satisfying all the following conditions: It is not o-minimal; All models are strongly locally o-minimal; It has a model which is an expansion of the linearly ordered abelian group over the reals…
The trapping redundancy of a linear code is the number of rows of a smallest parity-check matrix such that no submatrix forms an $(a,b)$-trapping set. This concept was first introduced in the context of low-density parity-check (LDPC) codes…
Given a first-order theory $T$ formulated in the usual language of first-order arithmetic, we say that $T$ is of *restricted complexity* if there is some natural number $n$ and some set $\mathcal A$ of $\Sigma_n$-sentences such that $T$ can…
This article initiates the semantic study of distribution-free normal modal logic systems, laying the semantic foundations and anticipating further research in the area. The article explores roughly the same area, though taking a different…
A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…
In classical network reliability analysis, the system under study is a network with perfect nodes but imperfect link, that fail stochastically and independently. There, the goal is to find the probability that the resulting random graph is…