Related papers: Relational Models for the Lambek Calculus with Int…

Let $E$ be a Banach space such that $E'$ has the Radon-Nikod\'ym property. The aim of this work is to connect relative weak compactness in the $E$-valued martingale Hardy space $H^{1}(\mu,E)$ to a convex compactness criterion in a weaker…

Standard abstract model checking relies on abstract Kripke structures which approximate concrete models by gluing together indistinguishable states, namely by a partition of the concrete state space. Strong preservation for a specification…

Let 2<n\leq l<m< \omega. Let L_n denote first order logic restricted to the first n variables. We show that the omitting types theorem fails dramatically for the n--variable fragments of first order logic with respect to clique guarded…

We prove rigidity type results on the vanishing of stable (co)homology for modules of finite complete intersection dimension, results which generalize and improve upon known results. We also introduce a notion of pre-rigidity, which…

We focus on the persistence principle over weak interpretability logic. Our object of study is the logic obtained by adding the persistence principle to weak interpretability logic from several perspectives. Firstly, we prove that this…

Complex moment sequences are exactly those which admit positive definite extensions on the integer lattice points of the upper diagonal half-plane. Here we prove that the aforesaid extension is unique provided the complex moment sequence is…

We prove undecidability and pinpoint the place in the arithmetical hierarchy for commutative action logic, that is, the equational theory of commutative residuated Kleene lattices (action lattices), and infinitary commutative action logic,…

We study the computational complexity of the parsing problem of a variant of Lambek Categorial Grammar that we call {\em semidirectional}. In semidirectional Lambek calculus $\SDL$ there is an additional non-directional abstraction rule…

We consider the linear complementarity problem with uncertain data modeled by intervals, representing the range of possible values. Many properties of the linear complementarity problem (such as solvability, uniqueness, convexity, finite…

This paper shows connections between command injection attacks, continuations, and the Lambek calculus: certain command injections, such as the tautology attack on SQL, are shown to be a form of control effect that can be typed using the…

We consider the Lambek invariants (introduced by Joachim Lambek in 1964) in the context of semiexact and homological categories in the sense of Grandis. We generalize the Lambek isomorphism theorem to semiexact and homological categories.…

We consider the problems of determining the feasibility of a linear congruence, producing a solution to a linear congruence, and finding a spanning set for the nullspace of an integer matrix, where each problem is considered modulo an…

This paper extends the Concentration-Compactness Principle to Musielak-Orlicz spaces, working in both bounded and unbounded domains. We show that our results include important special cases like classical Orlicz spaces, variable exponent…

The present essay aims at investigating whether and how far an algebraic analysis of the Zeta Function and of the Riemann Hypothesis can be carried out. Of course the well-established properties of the Zeta Function, explored in depth in…

We primarily investigate congruences modulo $p$ for finite sums of the form $\sum_k\binom{rk}{k}x^k/k$ over the ranges $0<k<p$ and $0<k<p/r$, where $p$ is a prime larger than the positive integer $r$. Here $x$ is an indeterminate, thus…

This paper is mainly concerned with the relation-algebraical aspects of the well-known Region Connection Calculus (RCC). We show that the contact relation algebra (CRA) of certain RCC model is not atomic complete and hence infinite. So in…

As a consequence of the main result of this paper efficient conditions guaranteeing the existence of a $T-$periodic solution to the second order differential equation \begin{equation*} u"=\frac{h(t)}{u^{\lambda}} \end{equation*} are…

We give a simple, elementary proof that a uniform algebra is weakly sequentially complete if and only if it is finite-dimensional.

On the ground of a general theorem concerning the admissibility of the structural rules in sequent calculi with additional atomic rules, we develop a proof theoretic analysis for several extensions of the ${\bf G3[mic]}$ sequent calculi…

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…