Related papers: Delimited control operators prove Double-negation …

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

We present a bisequent calculus (BSC) for the minimal theory of definite descriptions (DD) in the setting of neutral free logic, where formulae with non-denoting terms have no truth value. The treatment of quantifiers, atomic formulae and…

We develop a general theory of jump operators, which is intended to provide an abstraction of the notion of "limit-computability" on represented spaces. Jump operators also provide a framework with a strong categorical flavor for…

We construct projective limit of projective sequence in the following categories: Archimedean order unit spaces with unital positive maps and operator systems with unital completely positive maps. We prove that inductive limit and…

We systematically study various aspects of operator-valued multishifts. Beginning with basic properties, we show that the class of multishifts on the directed Cartesian product of rooted directed trees is contained in that of…

In this paper, we consider a class of second-order evolution differential inclusions in Hilbert spaces. This paper deals with the approximate controllability for a class of second-order control systems. First, we establish a set of…

A straightforward argument shows that, by allowing counterfactual elements of physical reality, any arbitrary discrete finite-dimensional operator corresponds to an observable.

We introduce proper display calculi for basic monotonic modal logic,the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

We present a proof system that extends action logic by omega iteration, which is viewed as infinitary multiplicative conjunction. We prove cut admissibility and establish complexity bounds for the provability predicate.

We prove a dichotomy of almost periodicity for reflectionless one-dimensional Dirac operators whose spectra satisfy certain geometric conditions, extending work of Volberg--Yuditskii. We also construct a weakly mixing Dirac operator with a…

In this article, we consider the operations of insertion and deletion working in a graph-controlled manner. We show that like in the case of context-free productions, the computational power is strictly increased when using a control graph:…

Larsen and Skou characterized probabilistic bisimilarity over reactive probabilistic systems with a logic including true, negation, conjunction, and a diamond modality decorated with a probabilistic lower bound. Later on, Desharnais,…

We give a short proof of the existence of disjoint hypercyclic tuples of operators of any given length on any separable infinite dimensional Frechet space. A similar argument provides disjoint dual hypercyclic tuples of operators of any…

The analysis of industrial processes, modelled as descriptor systems, is often computationally hard due to the presence of both algebraic couplings and difference equations of high order. In this paper, we introduce a control refinement…

We present a simpler way than usual to deduce the completeness theorem for the second-oder classical logic from the first-order one. We also extend our method to the case of second-order intuitionistic logic.

Controllability and observability are important properties of a distributed paramater systems.The equivalence between the notion of exact observability and exact controllability holds in general. In this work, we define a new notion of…

We present verification methods for logic programs with delay declarations. The verified properties are termination and freedom from errors related to built-ins. Concerning termination, we present two approaches. The first approach tries to…

We present an extension of Willems' Fundamental Lemma to the class of multi-input multi-output discrete-time feedback linearizable nonlinear systems, thus providing a data-based representation of their input-output trajectories. Two sources…

We study two-dimensional subshifts whose horizontal trace (a.k.a. projective subdynamics) contains only points of finite support. Our main result is a classification result for such subshifts satisfying a minimality property. As…

We present a first-order logic equipped with an "asymmetric" directed notion of equality, which can be thought of as rewrites between terms, allowing for types to be interpreted as preorders. The logic is equipped with a precise syntactic…