Related papers: Failure of Esakia's theorem in the monadic setting
This work contributes to the theory of judgment aggregation by discussing a number of significant non-classical logics. After adapting the standard framework of judgment aggregation to cope with non-classical logics, we discuss in…
In the Boehm theorem workshop on Crete island, Zoran Petric called Statman's ``Typical Ambiguity theorem'' typed Boehm theorem. Moreover, he gave a new proof of the theorem based on set-theoretical models of the simply typed lambda…
Motivated by questions like: which spatial structures may be characterized by means of modal logic, what is the logic of space, how to encode in modal logic different geometric relations, topological logic provides a framework for studying…
We prove a Goldblatt-Thomason theorem for dialgebraic intuitionistic logics, and instantiate it to Goldblatt-Thomason theorems for a wide variety of modal intuitionistic logics from the literature.
This paper aims to give an epistemic interpretation to the tensor disjunction in dependence logic, through a rather surprising connection to the so-called weak disjunction in Medvedev's early work on intermediate logic under the…
In a previous work we introduced a non-associative non-commutative logic extended by multimodalities, called subexponentials, licensing local application of structural rules. Here, we further explore this system, considering a classical…
In Aristotelian logic, categorical propositions are divided in Universal Affirmative, Universal Negative, Particular Affirmative and Particular Negative. Possible relations between two of the mentioned type of propositions are encoded in…
Coalition Logic is primarily concerned with what coalitions can achieve, whereas what coalitions cannot achieve -- their \emph{inability} -- has received comparatively little explicit attention. This asymmetry matters in artificial…
Judgment aggregation studies how to combine individual judgments on logically related propositions into a collective judgment. Classical impossibility results show that sufficiently strong logical interconnections force dictatorship under…
Algebraic logic studies algebraic theories related to proposition and first-order logic. A new algebraic approach to first-order logic is sketched in this paper. We introduce the notion of a quantifier theory, which is a functor from the…
The general conditions for the applicability of the Faddeev-Jackiw approach to gauge theories are studied. When the constraints are effective a new proof in the Lagrangian framework of the equivalence between this method and the Dirac…
A proof for the maximum modulus principle (in the unit disc) is presented. This proof is unusual in that it is based on linear algebra.
In this article we introduce the variety of monadic BL-algebras as BL-algebras endowed with two monadic operators $\forall$ and $\exists$. After a study of the basic properties of this variety we show that this class is the equivalent…
The algebraic properties of the combination of probabilistic choice and nondeterministic choice have long been a research topic in program semantics. This paper explains a formalization in the Coq proof assistant of a monad equipped with…
We study the modal logic of the closure algebra $P_2$, generated by the set of all polygons in the Euclidean plane $\mathbb{R}^2$. We show that this logic is finitely axiomatizable, is complete with respect to the class of frames we call…
As part of the author's studies on equational reasoning for monadic programs, this report focus on non-determinism monad. We discuss what properties this monad should satisfy, what additional operators and notations can be introduced to…
We show that the analogues of the Hamkins embedding theorems, proved for the countable models of set theory, do not hold when extended to the uncountable realm of $\omega_1$-like models of set theory. Specifically, under the $\diamondsuit$…
The Alexandrov topology affords a well-known semantics of modal necessity and possibility. This paper develops an Alexandrov topological semantics of intuitionistic propositional modal logic internally in any elementary topos. This is done…
The paper explores properties of {\L}ukasiewicz mu-calculus, a version of the quantitative/probabilistic modal mu-calculus containing both weak and strong conjunctions and disjunctions from {\L}ukasiewicz (fuzzy) logic. We show that this…
We propose modal Markov logic as an extension of propositional Markov logic to reason under the principle of maximum entropy for modal logics K45, KD45, and S5. Analogous to propositional Markov logic, the knowledge base consists of…