Metraipolis › archive › dc_685cfff117ec

Infinitary provability logic — arXiv:2609.24795

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.24795
License (as archived)
CC0-1.0
Archived
2026-10-09T21:57:58.082Z
SHA-256 of the archived text
ac96d7f7238adb214f0259edf9280b48c6d172abcd0d0abf51ca52d82542b77b
Stable URL of this page
https://metraipolis.com/documento/dc_685cfff117ec

How to cite

Infinitary provability logic — arXiv:2609.24795 — arXiv (en), https://arxiv.org/abs/2609.24795 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_685cfff117ec (Metraipolis archive dc_685cfff117ec, sha256 ac96d7f7238adb214f0259edf9280b48c6d172abcd0d0abf51ca52d82542b77b)
BibTeX
@misc{dc685cfff117ec,
  title = {Infinitary provability logic — arXiv:2609.24795},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.24795},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_685cfff117ec; sha256 ac96d7f7238adb214f0259edf9280b48c6d172abcd0d0abf51ca52d82542b77b},
  year = {2026}
}

Archived text

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

Gödel-Löb provability logic $\GL$ is a propositional modal system that on one hand enjoys completeness with respect to conversely well-founded Kripke frames and on the other hand captures all modal principles about $\PA$-provability that are provable in $\PA$ itself. In the present paper we carry out an initial investigation into the question of what the infinitary counterpart of $\GL$ is. We develop a non-well-founded deep inference proof system $\dgla$ for the modal language with at most countably infinite conjunctions and disjunctions. We show that the calculus is sound and complete for well-founded transitive Kripke frames. Using Kripke-Platek set theory we develop an interpretation of the infinitary modal language in terms of infinitary provability over admissible sets. Then we show that a natural Hilber-style variant of infinitary $\GL$ is sound for this interpretation. We leave open, however, the question if $\dgla$ proves any additional theorems in comparison with the Hilbert-style calculus. Nevertheless, under certain conditions we do show that the infinitary provability logic arising from certain admissible sets lies between the set of theorems of the Hilbert-style calculus and the non-well-founded deep inference system.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.LO).
Categorie arXiv: Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.24795 — 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-09T21:44:20.589Z dalla pagina https://arxiv.org/catchup/math.LO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).