Related papers: Weakly Aggregative Modal Logic: Characterization a…
We consider the property of unique parallel decomposition modulo branching and weak bisimilarity. First, we show that infinite behaviours may fail to have parallel decompositions at all. Then, we prove that totally normed behaviours always…
This article presents three characterizations of the weak factorization systems on finitely complete categories that interpret intensional dependent type theory with Sigma-, Pi-, and Id-types. The first characterization is that the weak…
We study the categorical-algebraic condition that internal actions are weakly representable (WRA) in the context of varieties of (non-associative) algebras over a field. Our first aim is to give a complete characterization of action…
We prove nonuniqueness of weak solutions to multi-dimensional generalisation of the Aw-Rascle model of vehicular traffic. Our generalisation includes the velocity offset in a form of gradient of density function, which results in a…
Recent empirical evidence has driven conventional wisdom to believe that gradient-based meta-learning (GBML) methods perform well at few-shot learning because they learn an expressive data representation that is shared across tasks.…
Let $W_n^+$ be the Lie algebra of the Lie algebra of vector fields on $\C^n$. In this paper, we classify all simple bounded weight $W_n^+$ modules. Any such module is isomorphic to the simple quotient of a tensor module $F(P,M)=P\otimes M$…
We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…
We investigate game-theoretic properties of selection principles related to weaker forms of the Menger and Rothberger properties. For appropriate spaces some of these selection principles are characterized in terms of a corresponding game.…
To achieve general intelligence, agents must learn how to interact with others in a shared environment: this is the challenge of multiagent reinforcement learning (MARL). The simplest form is independent reinforcement learning (InRL), where…
Multi-agent reinforcement learning (MARL) lies at the heart of a plethora of applications involving the interaction of a group of agents in a shared unknown environment. A prominent framework for studying MARL is Markov games, with the goal…
In \cite{Craig}, we introduced a syntactically defined and highly general class of calculi known as \emph{semi-analytic}. We then demonstrated that any sufficiently strong (modal) substructural logic with a semi-analytic calculus must…
The fuzzy modality `probably` is interpreted over probabilistic type spaces by taking expected truth values. The arising probabilistic fuzzy description logic is invariant under probabilistic bisimilarity; more informatively, it is…
Convolutional Dictionary Learning (CDL) has emerged as a powerful approach for signal representation by learning translation-invariant features through convolution operations. While existing CDL methods are predominantly designed and used…
We introduce an equivariant version of the weak expectation property (WEP) at the level of operator modules over completely contractive Banach algebras $A$. We prove a number of general results---for example, a characterization of the…
For many physical quantities, theory supplies weak- and strong-coupling expansions of the types $\sum a_n \alpha ^n$ and $ \alpha ^p\sum b_n (\alpha^{-2/q) ^n$, respectively. Either or both of these may have a zero radius of convergence. We…
We study weak commutative algebras in a symmetric monoidal model category $\mathscr{M}$. We provide a model structure on these algebras for any symmetric monoidal model category that is combinatorial and left proper. Our motivation was to…
The goal of this note is to classify the weakly closed unipotent subgroups in the split Chevalley groups. In an application we show under some mild assumptions on the characteristic that the Lie algebra of a connected simple algebraic group…
Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [16], we classified all commutative weakly distance-regular digraphs whose underlying graphs are Hamming graphs, folded n-cubes, or Doob graphs.…
The Weak Completion Semantics (WCS) is a computational cognitive theory that has shown to be successful in modeling episodes of human reasoning. As the WCS is a recently developed logic programming approach, this paper investigates the…
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…