A note on the interpretability logic of finitely axiomatized theories

Studia Logica 50 (2):241 - 250 (1991)
  Copy   BIBTEX

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.

Categories

Keywords

Reprint years

DOI

10.1007/bf00370185

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A note on the interpretability logic of finitely axiomatized theories.Maarten de Rijke - 1991 - Studia Logica 50 (2):241-250.
Complexity of the interpretability logics ILW and ILP.Luka Mikec - 2023 - Logic Journal of the IGPL 31 (1):194-213.
Interpretability degrees of finitely axiomatized sequential theories.Albert Visser - 2014 - Archive for Mathematical Logic 53 (1-2):23-42.
A cut-free sequent system for the smallest interpretability logic.Katsumi Sasaki - 2002 - Studia Logica 70 (3):353-372.
Two new series of principles in the interpretability logic of all reasonable arithmetical theories.Evan Goris & Joost J. Joosten - 2020 - Journal of Symbolic Logic 85 (1):1-25.
The unprovability of small inconsistency.Albert Visser - 1993 - Archive for Mathematical Logic 32 (4):275-298.
The Closed Fragment of the Interpretability Logic of PRA with a Constant for.Joost J. Joosten - 2005 - Notre Dame Journal of Formal Logic 46 (2):127-146.
Interpretability in.Marta Bílková, Dick de Jongh & Joost J. Joosten - 2010 - Annals of Pure and Applied Logic 161 (2):128-138.
Arithmetical Completeness Theorem for Modal Logic $$mathsf{}$$.Taishi Kurahashi - 2018 - Studia Logica 106 (2):219-235.
Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.

Analytics

Added to PP
2009-01-28

Downloads
51 (#320,922)

6 months
10 (#308,654)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.
Self-Reference and Modal Logic.George Boolos & C. Smorynski - 1988 - Journal of Symbolic Logic 53 (1):306.

Add more references