Metraipolis › archive › dc_db643fa0f9ad
Proof Theory for Non-Contingency Logic — arXiv:2609.38975
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.38975
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T14:42:22.938Z
- SHA-256 of the archived text
e6b279472f6a13e9d3d01c5cc426d82ce44c218df7ddd572634ad9a3519d38f2- Stable URL of this page
https://metraipolis.com/documento/dc_db643fa0f9ad
How to cite
Proof Theory for Non-Contingency Logic — arXiv:2609.38975 — arXiv (en), https://arxiv.org/abs/2609.38975 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_db643fa0f9ad (Metraipolis archive dc_db643fa0f9ad, sha256 e6b279472f6a13e9d3d01c5cc426d82ce44c218df7ddd572634ad9a3519d38f2)
BibTeX
@misc{dcdb643fa0f9ad,
title = {Proof Theory for Non-Contingency Logic — arXiv:2609.38975},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.38975},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_db643fa0f9ad; sha256 e6b279472f6a13e9d3d01c5cc426d82ce44c218df7ddd572634ad9a3519d38f2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38975. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
{Non-contingency logic $(\KWL)$ replaces the usual necessity operator of modal logic with an operator expressing that a proposition is necessarily true or necessarily false. Besides its intrinsic logical interest, it admits natural interpretations as knowing whether in epistemic logic and as decidability under the arithmetical interpretation of provability logic. Although the semantics of non-contingency logic have been extensively studied, its proof theory remains comparatively underdeveloped. In this paper, we develop a uniform proof-theoretic framework for $\KWL$ over a broad class of frame conditions. Our approach is based on generalized path conditions (GPCs), a grammar-theoretic formalism that uniformly captures many standard modal frame properties. For every finite set $\gpc$ of GPCs, we construct a corresponding labelled sequent calculus. All calculi share a common set of logical rules and differ only by a single structural rule generated from $\gpc$, which captures the underlying frame conditions. We prove that these calculi are sound and complete with respect to their corresponding frame classes, thereby providing a uniform proof theory for a large family of non-contingency logics.}
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.LO).
Categorie arXiv: Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.38975 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:16:08.313Z dalla pagina https://arxiv.org/catchup/math.LO/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).