Related papers: Disjunction and existence properties in modal arit…
Many formal languages include binders as well as operators that satisfy equational axioms, such as commutativity. Here we consider the nominal language, a general formal framework which provides support for the representation of binders,…
Product identities in two variables $x, q$ expand infinite products as infinite sums, which are linear combinations of theta functions; famous examples include Jacobi's triple product identity, Watson's quintuple identity, and Hirschhorn's…
In this notes unbounded regular operators on Hilbert $C^*$-modules over arbitrary $C^*$-algebras are discussed. A densely defined operator $t$ possesses an adjoint operator if the graph of $t$ is an orthogonal summand. Moreover, for a…
In a previous paper, we showed that profinite $L$-algebras (where $L$ is a variety of modal algebras generated by its finite members) are monadic over $\mathbf{Set}$. This monadicity result suggests that profinite $L$-algebras could be…
We consider optimization problems with a disjunctive structure of the constraints. Prominent examples of such problems are mathematical programs with equilibrium constraints or vanishing constraints. Based on the concepts of directional…
The concurrent refinement algebra has been developed to support rely/guarantee reasoning about concurrent programs. The algebra supports atomic commands and defines parallel composition as a synchronous operation, as in Milner's SCCS. In…
We investigate closure operators and describe their properties for $E$-combinations and $P$-combinations of structures and their theories. We prove, for $E$-combinations, that the existence of a minimal generating set of theories is…
In this article, we investigate the connection between certain real variable things and the Bergman theory. We first use Hardy-type inequalities to give an $L^2$ Hartogs-type extension theorem and an $L^p$ integrability theorem for the…
Let $\Omega$ denote an algebra of sets and $\mu$ a $\sigma$-finite measure. We then prove that the completion of $\Omega$ under the pseudometric $d(A,B)$ = $\mu^{\ast}(A \triangle B)$ is $\sigma$-algebra isomorphic and isometric to the…
In previous work, we defined and studied $\Sigma^*$-modules, a class of Hilbert $C^*$-modules over $\Sigma^*$-algebras (the latter are $C^*$-algebras that are sequentially closed in the weak operator topology). The present work continues…
Classical (or Boolean) type theory is the type theory that allows the type inference $\sigma \to \bot) \to \bot => \sigma$ (the type counterpart of double-negation elimination), where $\sigma$ is any type and $\bot$ is absurdity type. This…
It is well known from universal algebra that, for every signature $\Sigma$, there exist algebras over $\Sigma$ which are absolutely free, meaning that they do not satisfy any identities or, alternatively, satisfy the universal mapping…
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…
The purpose of the present paper is to analyze several variants of Solovay's theorem on the existence of doubly partially conservative sentences. First, we investigate $\Theta$ sentences that are doubly $(\Gamma, \Lambda)$-conservative over…
The stability theorem for persistent homology is a central result in topological data analysis. While the original formulation of the result concerns the persistence barcodes of $\mathbb{R}$-valued functions, the result was later cast in a…
It was recently proven that the total multiplicity in the decomposition into irreducibles of the tensor product lambda x mu of two irreducible representations of a simple Lie algebra is invariant under conjugation of one of them; at a given…
We examine the degree structure $\mathbf{ER}$ of equivalence relations on $\omega$ under computable reducibility. We examine when pairs of degrees have a join. In particular, we show that sufficiently incomparable pairs of degrees do not…
We deal with the existence of universal members in a given cardinality for several classes. First we deal with classes of Abelian groups, specifically with the existence of universal members in cardinalities which are strong limit singular…
Checking whether two pushdown automata with restricted silent actions are weakly bisimilar was shown decidable by S\'enizergues (1998, 2005). We provide the first known complexity upper bound for this famous problem, in the equivalent…
This thesis addresses the theory of topological spaces and the foundations of persistence theory. We will discuss chain complexes and the associated simplicial homology groups, as well as their relationship with singular homology theory.…