English
Related papers

Related papers: Modal Logics of Some Hereditarily Irresolvable Spa…

200 papers

We present a novel investigation into the consistency operator ($\circ$), traditionally associated with paraconsistent logics, as a means of capturing non-normal modal classicalities within the Kripke framework. By semantically…

Logic · Mathematics 2026-02-25 Alfredo Roque Freire , Manuel António Martins

It is a celebrated result of McKinsey and Tarski [28] that S4 is the logic of the closure algebra X+ over any dense-in-itself separable metrizable space. In particular, S4 is the logic of the closure algebra over the reals R, the rationals…

Logic · Mathematics 2013-11-12 Guram Bezhanisevili , David Gabelaia , Joel Lucero-Bryan

The aim of the paper is to study the topological modal logic of $T_0$ spaces, with the difference modality (for $T_n$, where $n\geq1 $ the corresponding logics were known). We consider propositional modal logic with two modal operators…

Logic · Mathematics 2019-12-03 Rajab Aghamov

Thomason \cite{Thomason74} showed that a certain modal logic $\mathbf{L}\subset \mathbf{S4}$ is incomplete with respect to Kripke semantics. Later Gerson \cite{Gerson75} showed that $\mathbf{L}$ is also incomplete with respect to…

Logic · Mathematics 2012-02-16 Jacob Vosmaer

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…

Logic in Computer Science · Computer Science 2019-01-30 Tiziano Dalmonte , Charles Grellois , Nicola Olivetti

Hereditary coreflective subcategories of an epireflective subcategory A of Top such that I_2\notin A (here I_2 is the 2-point indiscrete space) were studied in [C]. It was shown that a coreflective subcategory B of A is hereditary (closed…

General Topology · Mathematics 2011-09-05 Martin Sleziak

In this article, we give a family of examples of algebras, showing that for every $n \geq 2$ and $m \geq 0$, there is an algebra displaying a path of n irreducible morphisms between indecomposable modules whose composite lies in the…

Representation Theory · Mathematics 2025-07-14 Viktor Chust , Flávio U. Coelho

The use of exponentials in linear logic greatly enhances its expressive power. In this paper we focus on nonassociative noncommutative multiplicative linear logic, and systematically explore modal axioms K, T, and 4 as well as the…

Logic in Computer Science · Computer Science 2023-06-23 Eben Blaisdell

Polyhedral semantics is a recently introduced branch of spatial modal logic, in which modal formulas are interpreted as piecewise linear subsets of an Euclidean space. Polyhedral semantics for the basic modal language has already been well…

Logic in Computer Science · Computer Science 2024-06-25 Nick Bezhanishvili , Laura Bussi , Vincenzo Ciancia , David Fernández-Duque , David Gabelaia

We explore various semantic understandings of dual intuitionistic logic by exploring the relationship between co-Heyting algebras and topological spaces. First, we discuss the relevant ideas in the setting of Heyting algebras and…

Logic · Mathematics 2024-11-26 Safal Raman Aryal

We define the notion of a model of higher-order modal logic in an arbitrary elementary topos $\mathcal{E}$. In contrast to the well-known interpretation of (non-modal) higher-order logic, the type of propositions is not interpreted by the…

Logic · Mathematics 2017-03-07 Steve Awodey , Kohei Kishida , Hans-Christoph Kotzsch

Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…

Logic in Computer Science · Computer Science 2009-02-13 Lutz Schröder , Dirk Pattinson

A non-empty subset of a topological space is irreducible if whenever it is covered by the union of two closed sets, then already it is covered by one of them. Irreducible sets occur in proliferation: (1) every singleton set is irreducible,…

Logic in Computer Science · Computer Science 2016-10-04 Hadrian Andradi , Weng Kin Ho

Generalized topological spaces are not necessarily closed under finite intersections. Moreover, the whole universe does not need to be open. We use modified version of this framework to establish certain models for non-normal modal logics.…

Logic · Mathematics 2020-05-28 Tomasz Witczak

We study preservation theorems for modal logics over finite structures with respect to three fundamental semantic relations: embeddings, injective homomorphisms, and homomorphisms. We focus on classes of pointed Kripke models that are…

Logic in Computer Science · Computer Science 2026-02-03 Przemysław Andrzej Wałęga , Bernardo Cuenca Grau

We determine the ZF-provable modal logic of the modality $\Box_{\mathrm{sym}}$, where $\Box_{\mathrm{sym}}\varphi$ means '$\varphi$ holds in every finite symmetry-preserving iteration' of the symmetric method. We prove that the exact logic…

Logic · Mathematics 2025-10-23 Frank Gilson

In this paper we demonstrate decidability for the intuitionistic modal logic S4 first formulated by Fischer Servi. This solves a problem that has been open for almost thirty years since it had been posed in Simpson's PhD thesis in 1994. We…

Logic in Computer Science · Computer Science 2023-08-01 Marianna Girlando , Roman Kuznets , Sonia Marin , Marianela Morales , Lutz Straßburger

We establish a local model for the moduli space of holomorphic symplectic structures with logarithmic poles, near the locus of structures whose polar divisor is normal crossings. In contrast to the case without poles, the moduli space is…

Algebraic Geometry · Mathematics 2021-07-16 Mykola Matviichuk , Brent Pym , Travis Schedler

Quantified modal logic provides a natural logical language for reasoning about modal attitudes even while retaining the richness of quantification for referring to predicates over domains. But then most fragments of the logic are…

Logic in Computer Science · Computer Science 2018-03-29 Anantha Padmanabha , R. Ramanujam , Yanjing Wang

Polymodal provability logic GLP is incomplete w.r.t. Kripke frames. It is known to be complete w.r.t. topological semantics, where the diamond modalities correspond to topological derivative operations. However, the topologies needed for…

Logic · Mathematics 2024-07-16 Lev D. Beklemishev , Yunsong Wang