A note on the interpretability logic of finitely axiomatized theories
Lists
Only you see this
Abstract
In [6] Albert Visser shows that ILP completely axiomatizes all schemata about provability and relative interpretability that are provable in finitely axiomatized theories. In this paper we introduce a system called ILP ω that completely axiomatizes the arithmetically valid principles of provability in and interpretability over such theories. To prove the arithmetical completeness of ILP ω we use a suitable kind of tail models; as a byproduct we obtain a somewhat modified proof of Visser's completeness result.
BibTeX
@article{rijke1991note,
author = {Maarten de Rijke},
title = {{A note on the interpretability logic of finitely axiomatized theories}},
journal = {Stud Logica},
year = {1991},
doi = {10.1007/bf00370185},
}Loading related content...