On Modal Logics of Connectedness in Metric Spaces

For a positive number a, each metric space carries the relation D a consisting of those pairs that are of distance less than a apart.A space X is said to be a-connected, if the graph (X, D a ) is connected (that is, there is a D a -path between every pair of points in X).We give a complete axiomatization of a-connected metric spaces in the language with a family of distance modalities and the universal modality.Then we give a complete axiomatization of the logic of connected (in the classical topological sense) metric spaces in the language with the topological modality, universal modality, and a single distance modality.We also show that these logics have the finite model property.

Authors

Institutions

Publication Details

Journal
Electronic Proceedings in Theoretical Computer Science
Published
2026-06-28
DOI
https://doi.org/10.4204/eptcs.447.27
Primary Topic
Fixed Point Theorems Analysis
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Modal Logics of Connectedness in Metric Spaces

Ilya Shapirovsky, John Harding
Electronic Proceedings in Theoretical Computer Science
Fixed Point Theorems Analysis
article

On Modal Logics of Connectedness in Metric Spaces

Ilya Shapirovsky, John Harding
article en

Abstract

For a positive number a, each metric space carries the relation D a consisting of those pairs that are of distance less than a apart.A space X is said to be a-connected, if the graph (X, D a ) is connected (that is, there is a D a -path between every pair of points in X).We give a complete axiomatization of a-connected metric spaces in the language with a family of distance modalities and the universal modality.Then we give a complete axiomatization of the logic of connected (in the classical topological sense) metric spaces in the language with the topological modality, universal modality, and a single distance modality.We also show that these logics have the finite model property.

Electronic Proceedings in Theoretical Computer ScienceVol. 447
New Mexico State University (US)
National Science Foundation
Openalex Percentile: Top 4%
Fixed Point Theorems Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.