A Formal Characterization of Semantic Pollution of Modal Proof Systems

Abstract This paper provides a formal characterization of the phenomenon of ‘semantic pollution’ relative to proof systems for modal logic and Kripke semantics. We propose that semantic pollution can be made precise by several properties of syntax occurring in proof systems. First, our base requirement for semantic pollution is given by the property of violating invariance results under Kripke model equivalences. On top of that, the distinction between local and global syntax, and between syntax that is dependent on and independent from the propositional valuation, induce four levels of semantic pollution: weak pollution, global pollution, local pollution and strong pollution. We analyze several main proof systems for (extensions of) modal logic in terms of these levels of pollution: the display calculus, the hybrid calculus and the labeled calculus. The results show that the display calculus is only weakly semantically polluted, while the hybrid calculus has formulas introducing several types of pollution. The only calculus that is strongly semantically polluted is the labeled calculus. These formal results are in line with general intuitions about semantic pollution. Additionally, our formal framework for semantic pollution is suitable for applications to other logics and semantics. Finally, we comment on the relation of our framework to the philosophical debate surrounding semantic pollution.

Authors

Publication Details

Journal
Journal of Philosophical Logic
Published
2026-06-09
DOI
https://doi.org/10.1007/s10992-026-09853-7
Primary Topic
Logic, programming, and type systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

A Formal Characterization of Semantic Pollution of Modal Proof Systems

Robin Martinot
Journal of Philosophical Logic
Logic, programming, and type systems
article

A Formal Characterization of Semantic Pollution of Modal Proof Systems

Robin Martinot
article en

Abstract

Abstract This paper provides a formal characterization of the phenomenon of ‘semantic pollution’ relative to proof systems for modal logic and Kripke semantics. We propose that semantic pollution can be made precise by several properties of syntax occurring in proof systems. First, our base requirement for semantic pollution is given by the property of violating invariance results under Kripke model equivalences. On top of that, the distinction between local and global syntax, and between syntax that is dependent on and independent from the propositional valuation, induce four levels of semantic pollution: weak pollution, global pollution, local pollution and strong pollution. We analyze several main proof systems for (extensions of) modal logic in terms of these levels of pollution: the display calculus, the hybrid calculus and the labeled calculus. The results show that the display calculus is only weakly semantically polluted, while the hybrid calculus has formulas introducing several types of pollution. The only calculus that is strongly semantically polluted is the labeled calculus. These formal results are in line with general intuitions about semantic pollution. Additionally, our formal framework for semantic pollution is suitable for applications to other logics and semantics. Finally, we comment on the relation of our framework to the philosophical debate surrounding semantic pollution.

Journal of Philosophical Logic
Nederlandse Organisatie voor Wetenschappelijk Onderzoek
Openalex Percentile: Top 5%
Logic, programming, and type systems
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.