English
Related papers

Related papers: Topological Semantics and Decidability

200 papers

The unification problem in a propositional logic is to determine, given a formula F, whether there exists a substitution s such that s(F) is in that logic. In that case, s is a unifier of F. When a unifiable formula has minimal complete…

Logic in Computer Science · Computer Science 2020-04-20 Philippe Balbiani , Çiğdem Gencer , Maryam Rostamigiv , Tinko Tinchev

Topological semantics for modal logic based on the Cantor derivative operator gives rise to derivative logics, also referred to as $d$-logics. Unlike logics based on the topological closure operator, $d$-logics have not previously been…

Logic · Mathematics 2024-02-14 David Fernández-Duque , Yoàv Montacute

We present a finitary version of Moss' coalgebraic logic for $T$-coalgebras, where $T$ is a locally monotone endofunctor of the category of posets and monotone maps. The logic uses a single cover modality whose arity is given by the least…

Logic in Computer Science · Computer Science 2023-06-22 Marta Bílková , Matěj Dostál

Collective Adaptive Systems often consist of many heterogeneous components typically organised in groups. These entities interact with each other by adapting their behaviour to pursue individual or collective goals. In these systems, the…

Logic in Computer Science · Computer Science 2024-02-14 Michele Loreti , Michela Quadrini

In this thesis we shall present two logical systems, MP and MP, for the purpose of reasoning about knowledge and effort. These logical systems will be interpreted in a spatial context and therefore, the abstract concepts of knowledge and…

Logic in Computer Science · Computer Science 2007-05-23 Konstantinos Georgatos

Causality is one of the fundamental structures of spacetimes, determining the possible behaviour and propagation of physical information. Causal structure can be analysed through the various modal logics it induces. The modal logics for the…

Logic · Mathematics 2026-03-17 Marco Lewis , Nesta van der Schaaf

The language of linear temporal logic can be interpreted over the class of dynamic topological systems, giving rise to the intuitionistic temporal logic ${{\sf ITL}^{\sf c}}_{\Diamond,\forall}$, recently shown to be decidable by…

Logic in Computer Science · Computer Science 2019-10-03 Joseph Boudou , Martín Diéguez , David Fernández-Duque

This paper studies the modal logical aspects of provability predicates and consistency statements for theories of arithmetic. First, we provide an overview of previous works on the correspondence between various derivability conditions for…

Logic · Mathematics 2025-11-20 Haruka Kogure , Taishi Kurahashi

A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…

Logic · Mathematics 2026-01-06 Maciej Malicki

Dynamic Topological Logic ($\mathcal{DTL}$) is a combination of $\mathcal{S}${\em 4}, under its topological interpretation, and the temporal logic $\mathcal{LTL}$ interpreted over the natural numbers. $\mathcal{DTL}$ is used to reason about…

Logic · Mathematics 2016-11-22 David Fernández-Duque

The logics CS4 and IS4 are intuitionistic variants of the modal logic S4. Whether the finite model property holds for each of these logics has been a long-standing open problem. In this paper we introduce two logics closely related to IS4:…

Logic in Computer Science · Computer Science 2021-05-03 Philippe Balbiani , Martín Diéguez , David Fernández-Duque

We present a family of minimal modal logics (namely, modal logics based on minimal propositional logic) corresponding each to a different classical modal logic. The minimal modal logics are defined based on their classical counterparts in…

Logic in Computer Science · Computer Science 2025-08-13 Tiziano Dalmonte

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

Given a graded $E_1$-module over an $E_2$-algebra in spaces, we construct an augmented semi-simplicial space up to higher coherent homotopy over it, called its canonical resolution, whose graded connectivity yields homological stability for…

Algebraic Topology · Mathematics 2019-10-23 Manuel Krannich

Modal logics are widely used in computer science. The complexity of their satisfiability problems has been an active field of research since the 1970s. We prove that even very "simple" modal logics can be undecidable: We show that there is…

Logic in Computer Science · Computer Science 2011-05-05 Edith Hemaspaandra , Henning Schnoor

One of the nice properties of the first-order logic is the compactness of satisfiability. It state that a finitely satisfiable theory is satisfiable. However, different degrees of satisfiability in many-valued logics, poses various kind of…

Logic · Mathematics 2022-06-02 Seyed Mohammad Amin Khatami

In this short paper we will discuss the similarities and differences between two semantic approaches to modal logics - non-deterministic semantics and restricted non-deterministic semantics. Generally speaking, both kinds of semantics are…

Logic in Computer Science · Computer Science 2025-01-03 Marcelo E. Coniglio , Paweł Pawłowski , Daniel Skurt

Dynamical systems are abstract models of interaction between space and time. They are often used in fields such as physics and engineering to understand complex processes, but due to their general nature, they have found applications for…

Logic · Mathematics 2023-06-01 David Fernández-Duque , Yoàv Montacute

The paper investigates an evidence-based semantics for epistemic logics. It is shown that the properties of knowledge obtained from a potentially infinite body of evidence are described by modal logic S5. At the same time, the properties of…

Logic in Computer Science · Computer Science 2021-06-23 Pavel Naumov , Jia Tao

Let M be a meromorphic connection with poles along a smooth divisor D in a smooth algebraic variety. Let Sol M be the solution complex of M. We prove that the good formal decomposition locus of M coincides with the locus where the…

Algebraic Geometry · Mathematics 2019-03-20 Jean-Baptiste Teyssier