Related papers: Symmetries in Modal Logics
This chapter presents a state-of-the-art survey of relationships, traditionally referred to as `bridges', between interpolation properties for propositional logics -- including superintuitionistic, modal, and substructural logics -- and…
In previous works, a tableau calculus has been defined, which constitutes a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work shows how to extend such a calculus to…
The "Modularity Conjecture" is the assertion that the join of two nonmodular varieties is nonmodular. We establish the veracity of this conjecture for the case of linear idempotent varieties. We also establish analogous results concerning…
This paper investigates summability principles for multilinear summing operators. The main result presents a novel inclusion theorem for a class of summing operators, which generalizes several classical results. As applications, we derive…
Physical theories grounded in mathematical symmetries are an essential component of our understanding of a wide range of properties of the universe. Similarly, in the domain of machine learning, an awareness of symmetries such as rotation…
Generalized symmetries and supersymmetries depending on derivatives of dynamic variables are treated in a most general setting. Studding cohomology of the variational bicomplex, we state the first variational formula and conservation laws…
Inspired by a recent graphical formalism for lambda-calculus based on linear logic technology, we introduce an untyped structural lambda-calculus, called lambda j, which combines actions at a distance with exponential rules decomposing the…
The Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional…
Taking inspiration from the monadicity of complete atomic Boolean algebras, we prove that profinite modal algebras are monadic over Set. While analyzing the monadic functor, we recover the universal model construction - a construction…
We investigate combinatorial dynamical systems on simplicial complexes considered as {\em finite topological spaces}. Such systems arise in a natural way from sampling dynamics and may be used to reconstruct some features of the dynamics…
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…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
We look at equivalence relations on the set of models of a theory -- MERs, for short -- such that the class of equivalent pairs is itself an elementary class, in a language appropriate for pairs of models. We provide many examples of…
Conceiving of premises as collected into sets or multisets, instead of sequences, may lead to triviality for classical and intuitionistic logic in general proof theory, where we investigate identity of deductions. Any two deductions with…
This paper presents a many-sorted polyadic modal logic that generalizes some of the existing approaches. The algebraic semantics has led us to a many-sorted generalization of boolean algebras with operators, for which we prove the analogue…
Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…
We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…
The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to…
In this paper, we study aggregation rules with nontrivial symmetric classes of invariant sets (restricted domains), assuming that they, unlike others, have a logical nature. In the simplest case, we provide a complete classification of such…
In two earlier papers we derived congruence formats with regard to transition system specifications for weak semantics on the basis of a decomposition method for modal formulas. The idea is that a congruence format for a semantics must…