Related papers: The modal theory of linear orders

We apply to operator algebra theory a monotone selection principle which apparently escaped attention (of operator algebra theorists) so far. This principle relates to the basic order theoretic characterisation of von Neumann algebras given…

In previous work "Betweenness algebras" we introduced and examined the class of betweenness algebras. In the current paper we study a larger class of algebras with binary operators of possibility and sufficiency, the weak mixed algebras.…

Variational and divergence symmetries are studied in this paper for linear equations of maximal symmetry in canonical form, and the associated first integrals are given in explicit form. All the main results obtained are formulated as…

We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…

In these lecture notes, we first recall the connection between graph neural networks, Weisfeiler-Lehman tests and logics such as first-order logic and graded modal logic. We then present a modal logic in which counting modalities appear in…

We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…

Modal logics are widely used in computer science. The complexity of their satisfiability problems has been an active field of research since the 1970s. We prove that even very "simple" modal logics can be undecidable: We show that there is…

In the propositional setting, the marginal problem is to find a (maximum-entropy) distribution that has some given marginals. We study this problem in a relational setting and make the following contributions. First, we compare two…

We study the model-checking problem for first- and monadic second-order logic on finite relational structures. The problem of verifying whether a formula of these logics is true on a given structure is considered intractable in general, but…

Bilinear maps and their classifying tensor products are well-known in the theory of linear algebra, and their generalization to algebras of commutative monads is a classical result of monad theory. Motivated by constructions needed in…

We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…

We develop an abstract look at linear optical networks from the viewpoint of combinatorics and permanents. In particular we show that calculation of matrix elements of unitarily transformed photonic multi-mode states is intimately linked to…

We study monads resulting from the combination of nondeterministic and probabilistic behaviour with the possibility of termination, which is essential in program semantics. Our main contributions are presentation results for the monads,…

An extension of order theory is presented that serves as a formalism for the study of dendroidal sets analogously to way the formalism of order theory is used in the study of simplicial sets.

Hybrid logic extends modal logic with special propositions called nominals, each of which is true at only one state in a model. This enables us to describe some properties of binary relations, such as irreflexivity and anti-symmetry, which…

This paper is concerned with the concept of linear repetitivity in the theory of tilings. We prove a general uniform subadditive ergodic theorem for linearly repetitive tilings. This theorem unifies and extends various known (sub)additive…

We give a new method to construct linear spaces of matrices of constant rank, based on truncated graded cohomology modules of certain vector bundles as well as on the existence of graded Artinian modules with pure resolutions. Our method…

The concept of scattered polynomials is generalized to those of exceptional scattered sequences which are shown to be the natural algebraic counterpart of $\mathbb{F}_{q^n}$-linear MRD codes. The first infinite family in the first…

In this paper, we construct an infinitary variant of the relational model of linear logic, where the exponential modality is interpreted as the set of finite or countable multisets. We explain how to interpret in this model the fixpoint…

In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems---such as for instance natural deduction---are applied. Therefore, the…