Metraipolis › archive › dc_fd6fe93e877e

Modular proof analysis and cut elimination for the Reflection Calculi $\mathsf{RC}_1$ and $\mathsf{QRC}_1$ — arXiv:2611.01248

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01248
License (as archived)
CC0-1.0
Archived
2026-11-03T11:39:28.819Z
SHA-256 of the archived text
44875114cc24d45fb89159599c78750968b481a94be54c73228cd4c4365adf20
Stable URL of this page
https://metraipolis.com/documento/dc_fd6fe93e877e

How to cite

Modular proof analysis and cut elimination for the Reflection Calculi $\mathsf{RC}_1$ and $\mathsf{QRC}_1$ — arXiv:2611.01248 — arXiv (en), https://arxiv.org/abs/2611.01248 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fd6fe93e877e (Metraipolis archive dc_fd6fe93e877e, sha256 44875114cc24d45fb89159599c78750968b481a94be54c73228cd4c4365adf20)
BibTeX
@misc{dcfd6fe93e877e,
  title = {Modular proof analysis and cut elimination for the Reflection Calculi $mathsfRC_1$ and $mathsfQRC_1$ — arXiv:2611.01248},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01248},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fd6fe93e877e; sha256 44875114cc24d45fb89159599c78750968b481a94be54c73228cd4c4365adf20},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01248. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The reflection calculus with one modality is denoted by $\mathsf{RC}_1$ and its quantified generalization is known as $\mathsf{QRC}_1$. These decidable calculi are of interest since they generate the strictly positive fragments of the (quantified) provability logic for theories like Peano Arithmetic and Heyting Arithmetic. We introduce analytic cut-free calculi ${\mathrm{GRC1}}$ and ${\mathrm{GQRC1}}$ for $\mathsf{RC}_1$ and $\mathsf{QRC}_1$ respectively. The new calculi derive sequents of the form $A\Longrightarrow B$ with $A,B$ strictly positive formulas. In particular, the new calculi do not use (multi)sets nor nested sequents. For both ${\mathrm{GRC1}}$ and ${\mathrm{GQRC1}}$ it is shown that the cut-rule is admissible. As a consequence, it is proven that the calculi are deductively equivalent to $\mathsf{RC}_1$ and $\mathsf{QRC}_1$ respectively. The cutfree systems are used to prove uniform interpolation for the two reflection calculi. In addition, ${\mathrm{GRC1}}$ is used to give a syntactic proof of Dashkov's Theorem to the extent that $\mathsf{RC}_1$ is the strictly positive fragment of the provability logic ${\mathsf{GL}}$. The paper also introduces non-analytic calculi that are conceptually easier but proof-theoretically behave badly. It is shown that even those systems allow direct cut-elimination: the benefits of the strict positivity outweigh the draw-backs of a non-analytic calculus in these cases.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.LO, nuovi lavori del giorno).
Categorie arXiv: Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2611.01248 — 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-11-03T11:05:52.150Z dalla pagina https://arxiv.org/list/math.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).