Related papers: Failure of Esakia's theorem in the monadic setting
We investigate the complexity of modal satisfiability for certain combinations of modal logics. In particular we examine four examples of multimodal logics with dependencies and demonstrate that even if we restrict our inputs to…
We introduce quantum monadic and quantum cylindric algebras. These are adaptations to the quantum setting of the monadic algebras of Halmos, and cylindric algebras of Henkin, Monk and Tarski, that are used in algebraic treatments of…
If A/K is an abelian variety over a number field and P and Q are rational points, the original support conjecture asserted that if the order of Q (mod p) divides the order of P (mod p) for almost all primes p of K, then Q is obtained from P…
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,…
This paper is devoted to the study of noncommutative ergodic theorems for connected amenable locally compact groups. For a dynamical system $(\mathcal{M},\tau,G,\sigma)$, where $(\mathcal{M},\tau)$ is a von Neumann algebra with a normal…
The languages of logics based on team semantics typically only allow atomic negation or restricted negation. In this paper, we explore propositional team-based logics with full (intuitionistic) negation. We demonstrate that including full…
We show that the polymodal provability logic GLP, in a language with at least two modalities and one variable, has nullary unification type. More specifically, we show that the formula [1]p does not have maximal unifiers, and exhibit an…
Justification logics are an explication of modal logic; boxes are replaced with proof terms formally through realisation theorems. This can be achieved syntactically using a cut-free proof system e.g. using sequent, hypersequent or nested…
We investigate preservation results for the independent fusion of one-variable first-order modal logics. We show that, without equality, Kripke completeness and decidability of the global and local consequence relation are preserved, under…
We show that the sequential closure of a family of probability measures on the canonical space of c{\`a}dl{\`a}g paths satisfying Stricker's uniform tightness condition is a weak${}^*$ compact set of semimartingale measures in the pairing…
An iterative optimization method applied to a function $f$ on $\mathbb{R}^n$ will produce a sequence of arguments $\{\mathbf{x}_k\}_{k \in \mathbb{N}}$; this sequence is often constrained such that $\{f(\mathbf{x}_k)\}_{k \in \mathbb{N}}$…
We define a family of propositional constructive modal logics corresponding each to a different classical modal system. The logics are defined in the style of Wijesekera's constructive modal logic, and are both proof-theoretically and…
We give a new proof of a theorem of Mints that the positive fragment of minimal predicate logic is decidable. The idea of the proof is to replace the eigenvariable condition of sequent calculus by an appropriate scoping mechanism. The…
The plan existence problem asks, given a goal in the form of a formula in modal logic, an initial epistemic state (a pointed Kripke model), and a set of epistemic actions, whether there exists a sequence of actions that can be applied to…
In a previous work, the third named author found a combinatorics of line arrangements whose realizations live in the cyclotomic group of the fifth roots of unity and such that their non-complex-conjugate embedding are not topologically…
Communication facilitates coordination, but coordination might fail if there's too much uncertainty. I discuss a scenario in which vagueness-driven uncertainty undermines the possibility of publicly sharing a belief. I then show that…
We establish a generic upper bound ExpTime for reasoning with global assumptions (also known as TBoxes) in coalgebraic modal logics. Unlike earlier results of this kind, our bound does not require a tractable set of tableau rules for the…
We introduce a novel decidable fragment of first-order logic. The fragment is one-dimensional in the sense that quantification is limited to applications of blocks of existential (universal) quantifiers such that at most one variable…
Since particles obey wave equations, in general one is not free to postulate that particles move on the geodesics associated with test particles. Rather, for this to be the case one has to be able to derive such behavior starting from the…
The one-variable fragment of a first-order logic may be viewed as an "S5-like" modal logic, where the universal and existential quantifiers are replaced by box and diamond modalities, respectively. Axiomatizations of these modal logics have…