English
Related papers

Related papers: The universal tangle for spatial reasoning

200 papers

We study the topological $\mu$-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over $T_0$ and $T_D$ spaces. We also investigate…

Logic in Computer Science · Computer Science 2021-05-19 Alexandru Baltag , Nick Bezhanishvili , David Fernández-Duque

There has been renewed interest in recent years in McKinsey and Tarski's interpretation of modal logic in topological spaces and their proof that S4 is the logic of any separable dense-in-itself metric space. Here we extend this work to the…

Logic · Mathematics 2023-11-08 Robert Goldblatt , Ian Hodkinson

The continuous modal mu-calculus is a fragment of the modal mu-calculus, where the application of fixpoint operators is restricted to formulas whose functional interpretation is Scott-continuous, rather than merely monotone. By…

Logic in Computer Science · Computer Science 2021-09-20 Jan Rooduijn , Yde Venema

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…

Logic · Mathematics 2018-02-23 Katsuhiko Sano , Jonni Virtema

Quantum contextuality, a fundamental feature distinguishing quantum theory from classical models, is investigated via algebraic and topological structures inherent in modular tensor categories. This work rigorously demonstrates that braid…

Quantum Physics · Physics 2025-06-18 Tzu-Miao Chou

It is a classic result in modal logic that the category of modal algebras is dually equivalent to the category of descriptive frames. The latter are Kripke frames equipped with a Stone topology such that the binary relation is continuous.…

General Topology · Mathematics 2020-08-14 Guram Bezhanishvili , Luca Carai , Patrick Morandi

We develop and investigate a general theory of representations of second-order functionals, based on a notion of a right comodule for a monad on the category of containers. We show how the notion of comodule representability naturally…

Logic in Computer Science · Computer Science 2025-06-12 Danel Ahman , Andrej Bauer

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

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

A model of topological field theory is presented in which the vacuum coupling constants are topological invariants of the four-dimensional spacetime. Thus the coupling constants are theoretically computable, and they indicate the…

General Relativity and Quantum Cosmology · Physics 2016-11-15 N. V. Mitskievich , V. N. Efremov , A. M. Hernández Magdaleno

In this paper we systematically explore questions of succinctness in modal logics employed in spatial reasoning. We show that the closure operator, despite being less expressive, is exponentially more succinct than the limit-point operator,…

Logic · Mathematics 2017-08-15 David Fernández-Duque , Petar Iliev

A key result in the theory of the modal mu-calculus is the disjunctive normal form theorem by Janin & Walukiewicz, stating that every mu-calculus formula is semantically equivalent to a so-called disjunctive formula. These disjunctive…

Logic in Computer Science · Computer Science 2021-09-20 Clemens Kupke , Johannes Marti , Yde Venema

Diagrammatic notation has become a ubiquitous computational tool; early examples include Penrose's graphical notation for tensor calculus, Feynman's diagrams for perturbative quantum field theory, and Cvitanovic's birdtracks for Lie…

Algebraic Topology · Mathematics 2022-08-30 Christoph Dorn , Christopher L. Douglas

This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics…

Logic in Computer Science · Computer Science 2022-09-22 Luca Aceto , Antonis Achilleos , Elli Anastasiadi , Adrian Francalanza , Anna Ingolfsdottir

In this paper we consider topological spaces as generalised orders and characterise those spaces which satisfy a (suitably defined) topological distributive law. Furthermore, we show that the category of these spaces is dually equivalent to…

General Topology · Mathematics 2011-02-15 Dirk Hofmann

In arXiv:1604.08705 we introduced the propositional modal logic $\textbf{TSC}$ (which stands for Turing Schmerl Calculus) which adequately describes the provable interrelations between different kinds of Turing progressions. In…

Logic · Mathematics 2018-04-30 Eduardo Hermo Reyes

The lattice definition of the two-dimensional topological quantum field theory [Fukuma, {\em et al}, Commun.~Math.~Phys.\ {\bf 161}, 157 (1994)] is generalized to arbitrary (not necessarily orientable) compact surfaces. It is shown that…

High Energy Physics - Theory · Physics 2009-10-28 Vahid Karimipour , Ali Mostafazadeh

We propose a definition of computable manifold by introducing computability as a structure that we impose to a given topological manifold, just in the same way as differentiability or piecewise linearity are defined for smooth and PL…

Logic in Computer Science · Computer Science 2017-03-16 Marcelo A. Aguilar , Rodolfo Conde

A matrix formalism is proposed for computations based on Picard--Lefschetz theory in a 2D case. The formalism is essentially equivalent to the computation of the intersection indices necessary for the Picard--Lefschetz formula and enables…

Mathematical Physics · Physics 2025-12-22 A. V. Shanin , A. I. Korolkov , N. M. Artemov , R. C. Assier

In this note we provide an algorithm for translating relational structures into "proper" relational structures, i.e., those such that there is no pair of worlds w and u such that w is accessible from u for every agent. In particular, our…

Logic in Computer Science · Computer Science 2025-06-23 Adam Bjorndahl , Philip Sink
‹ Prev 1 2 3 10 Next ›