Metraipolis › archive › dc_7a864d5cc643

Proof Theory of Quantifier Shifts - An Overview — arXiv:2610.37887

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.37887
License (as archived)
CC0-1.0
Archived
2026-11-01T02:47:51.258Z
SHA-256 of the archived text
366ab0b7fb4c1ff1f962077a5869512de97bb086e8ce21dc80b9545a4a94c25d
Stable URL of this page
https://metraipolis.com/documento/dc_7a864d5cc643

How to cite

Proof Theory of Quantifier Shifts - An Overview — arXiv:2610.37887 — arXiv (en), https://arxiv.org/abs/2610.37887 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7a864d5cc643 (Metraipolis archive dc_7a864d5cc643, sha256 366ab0b7fb4c1ff1f962077a5869512de97bb086e8ce21dc80b9545a4a94c25d)
BibTeX
@misc{dc7a864d5cc643,
  title = {Proof Theory of Quantifier Shifts - An Overview — arXiv:2610.37887},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.37887},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7a864d5cc643; sha256 366ab0b7fb4c1ff1f962077a5869512de97bb086e8ce21dc80b9545a4a94c25d},
  year = {2026}
}

Archived text

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

Quantifier shifts are one of the oldest proof methods, but they are orthogonal to the cut free format: They can shorten proofs non-elementarily. (The proof is based on the sequence of proofs exhibiting a non-elementary difference between proofs with cuts and cut-free proofs by Orevkov). The cost is, however, that those proofs are globally sound but locally unsound. (Their subderivations might be unsound in contrast to the Hilbert concept of proof). In non-classical logics these calculi are only sound when all quantifier shifts are added. This characterizes all intermediate logics where Skolemization and the epsilon calculus is conservative (in contrast to the epsilon theorem which holds only for finite-valued Goedel logics).

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.LO, nuovi lavori del giorno).
Categorie arXiv: Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2610.37887 — 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-01T02:18:13.662Z dalla pagina https://arxiv.org/list/cs.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).