Graduate studies at Western
Studia Logica 50 (2):241 - 250 (1991)
|Abstract||In  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.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Petr Hájek & Vítězslav Švejdar (1991). A Note on the Normal Form of Closed Formulas of Interpretability Logic. Studia Logica 50 (1):25 - 28.
Alessandro Berarducci (1990). The Interpretability Logic of Peano Arithmetic. Journal of Symbolic Logic 55 (3):1059-1089.
Lev D. Beklemishev (1996). Bimodal Logics for Extensions of Arithmetical Theories. Journal of Symbolic Logic 61 (1):91-124.
Albert Visser (1991). The Formalization of Interpretability. Studia Logica 50 (1):81 - 105.
Claes Strannegård (1999). Interpretability Over Peano Arithmetic. Journal of Symbolic Logic 64 (4):1407-1425.
Joost J. Joosten & Albert Visser (2000). The Interpretability Logic of All Reasonable Arithmetical Theories. Erkenntnis 53 (1-2):3-26.
Katsumi Sasaki (2002). A Cut-Free Sequent System for the Smallest Interpretability Logic. Studia Logica 70 (3):353-372.
Added to index2009-01-28
Total downloads3 ( #214,470 of 749,171 )
Recent downloads (6 months)1 ( #62,892 of 749,171 )
How can I increase my downloads?