Feferman Interpretability
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909231914942464 |
|---|---|
| author | Joosten, Joost J. Mikec, Luka Visser, Albert |
| author_facet | Joosten, Joost J. Mikec, Luka Visser, Albert |
| contents | We introduce a modal logic FIL for Feferman interpretability. In this logic both the provability modality and the interpretability modality can come with a label. This label indicates that in the arithmetical interpretation the axiom set of the underlying base theory is tweaked so as to mimic behaviour of finitely axiomatised theories. The theory with the tweaked axiom set will be extensionally the same as the original theory though this equality will in general not be provable.
After providing the logic FIL and proving the arithmetical soundness, we set the logic to work to prove various interpretability principles to be sound in a large variety of (weak) arithmetical theories. In particular, we prove the two series of principles from [GJ20] to be arithmetically sound using FIL. Up to date, the arithmetical soundness of these series had only been proven using the techniques of definable cuts. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_18506 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Feferman Interpretability Joosten, Joost J. Mikec, Luka Visser, Albert Logic We introduce a modal logic FIL for Feferman interpretability. In this logic both the provability modality and the interpretability modality can come with a label. This label indicates that in the arithmetical interpretation the axiom set of the underlying base theory is tweaked so as to mimic behaviour of finitely axiomatised theories. The theory with the tweaked axiom set will be extensionally the same as the original theory though this equality will in general not be provable. After providing the logic FIL and proving the arithmetical soundness, we set the logic to work to prove various interpretability principles to be sound in a large variety of (weak) arithmetical theories. In particular, we prove the two series of principles from [GJ20] to be arithmetically sound using FIL. Up to date, the arithmetical soundness of these series had only been proven using the techniques of definable cuts. |
| title | Feferman Interpretability |
| topic | Logic |
| url | https://arxiv.org/abs/2406.18506 |