Related papers: The Complexity of the Constructive Master Modality
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…
We investigate the irreducible smooth $\widehat{\mathfrak{sl}}_{2}$-modules recently constructed in [Adv. Math. 481 (2025), 110559, 34 pages, arXiv:2404.03855], and demonstrate that these modules admit a Wakimoto-type realization at both…
Let ML(U^+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We characterize the relative definability of ML(U^+) relative to finite transitive frames in the…
Standard Description Logics (DLs) can encode quantitative aspects of an application domain through either number restrictions, which constrain the number of individuals that are in a certain relationship with an individual, or concrete…
We generalize the theory of stable canonical rules by adopting definable filtration, a generalization of the method of filtration. We show that for a modal rule system or a modal logic that admits definable filtration, each extension is…
We obtain poly-time embeddings of the intuitionistic modal logics FS and MIPC into their positive one-variable fragments.
While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…
Graded path modalities count the number of paths satisfying a property, and generalize the existential (E) and universal (A) path modalities of CTL*. The resulting logic is called GCTL*. We settle the complexity of satisfiability of GCTL*,…
The uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment to contexts involving relations of arity greater than two. Quantifiers in this logic are used in…
Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…
We introduce a notion of formally \'etale $\mathbb{E}_{\infty}$-coalgebras and show that they admit essentially unique, functorial lifts along square zero extensions of $\mathbb{E}_{\infty}$-rings. Using this, we show that for a perfect…
In this paper we construct a class of new irreducible modules over untwisted affine Kac-Moody algebras $\widetilde{\mathfrak{g}}$, generalizing and including both highest weight modules and Whittaker modules. These modules allow us to…
This paper from 2008 is the first in a series of three related papers on modal methods in interpretability logics and applications. In this first paper the foundations are laid for later results. These foundations consist of a thorough…
We study modal separability for fixpoint formulae: given two mutually exclusive fixpoint formulae $\varphi,\varphi'$, decide whether there is a modal formula $\psi$ that separates them, that is, that satisfies…
Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of G\"odel logic. The calculi are used to establish…
Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…
LTL synthesis -- the construction of a function to satisfy a logical specification formulated in Linear Temporal Logic -- is a 2EXPTIME-complete problem with relevant applications in controller synthesis and a myriad of artificial…
This paper presents the logic QRC$_1$, which is a strictly positive fragment of quantified modal logic. The intended reading of the diamond modality is that of consistency of a formal theory. Predicate symbols are interpreted as…
We introduce a hierarchy of models of the Axiom of Determinacy called \emph{Nairian models}. Forcing over the simplest Nairian model, we obtain a model of ${\sf{ZFC}}+{\sf{MM^{++}}}(c)+\neg\square_{\omega_3}+\neg\square(\omega_3)$. Then,…
The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…