相关论文: Succinctness in subsystems of the spatial mu-calcu…
In temporal logics, a central question is about the choice of modalities and their relative expressive power, in comparison to the complexity of decision problems such as satisfiability. In this tutorial, we will illustrate the study of…
We study quasi-modular pseudometric spaces as asymmetric refinements of modular metric structures. To each such space we associate canonical forward and backward quasi-uniformities and the corresponding directional topologies. We introduce…
In the realm of light logics deriving from linear logic, a number of variants of exponential rules have been investigated. The profusion of such proof systems induces the need for cut-elimination theorems for each logic, the proof of which…
We consider an extension of the modal logic of transitive closure K+ with some inifinitary derivations and present a sequent calculus for this extension, which allows non-well-founded proofs. For the given calculus, we obtain the…
We study the computational expressivity of proof systems with fixed point operators, within the 'proofs-as-programs' paradigm. We start with a calculus muLJ (due to Clairambault) that extends intuitionistic logic by least and greatest…
We define the notion of rational closure in the context of Description Logics extended with a tipicality operator. We start from ALC+T, an extension of ALC with a typicality operator T: intuitively allowing to express concepts of the form…
Let $\Omega\subset \mathbb{C}^n$ for $n\geq 2$ be a bounded pseudoconvex domain with a $C^2$-smooth boundary. We study the compactness of composition operators on the Bergman spaces of smoothly bounded convex domains. We give a partial…
There is a wide range of modal logics whose semantics goes beyond relational structures, and instead involves, e.g., probabilities, multi-player games, weights, or neighbourhood structures. Coalgebraic logic serves as a unifying semantic…
The extension of the concept of $p-$summability for linear operators to the context of Lipschitz operators on metric spaces has been extensively studied in recent years. This research primarily uses the linearization of the metric space $M$…
It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while the…
We study the computational complexity of the Local Hamiltonian problem under the promise that its ground state is succinctly represented. We show that the Succinct State 2-Local Hamiltonian problem, for qubit Hamiltonians, is (promise)…
We investigate non-wellfounded proof systems based on parsimonious logic, a weaker variant of linear logic where the exponential modality ! is interpreted as a constructor for streams over finite data. Logical consistency is maintained at a…
We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…
This paper proposes a basic proof theoretic framework for major modal logics: {\sf S5} and some of its subsystems. The framework is based on a version of hypersequent calculus, and the basic modal systems we handle here are the system {\sf…
A classic result by Stockmeyer gives a non-elementary lower bound to the emptiness problem for star-free generalized regular expressions. This result is intimately connected to the satisfiability problem for interval temporal logic, notably…
Subexponential logic is a variant of linear logic with a family of exponential connectives--called subexponentials--that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening…
Probabilistic systems are an important theme in AI domain. As the specification language, the logic PCTL is now the default logic for reasoning about probabilistic properties. In this paper, we present a natural and succinct probabilistic…
We apply to logic programming some recently emerging ideas from the field of reduction-based communicating systems, with the aim of giving evidence of the hidden interactions and the coordination mechanisms that rule the operational…
We study the minus order on the algebra of bounded linear operators on a Hilbert space. By giving a characterization in terms of range additivity, we show that the intrinsic nature of the minus order is algebraic. Applications to…
We investigate when the categories of all rational $A$-modules and of finite dimensional rational modules are closed under extensions inside the category of $C^*$-modules, where $C^*$ is the cofinite topological completion of $A$. We give a…