The interpretability logic of all reasonable arithmetical theories

Erkenntnis 53 (1-2):3-26 (2000)
  Copy   BIBTEX


This paper is a presentation of astatus quæstionis, to wit of the problemof the interpretability logic of all reasonablearithmetical theories.We present both the arithmetical side and themodal side of the question.Dedicated to Dick de Jongh on the occasion of his 60th birthday.



    Upload a copy of this work     Papers currently archived: 79,898

External links

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

Through your library


Added to PP

48 (#256,130)

6 months
2 (#319,941)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Growing Commas. A Study of Sequentiality and Concatenation.Albert Visser - 2009 - Notre Dame Journal of Formal Logic 50 (1):61-85.
Pairs, sets and sequences in first-order theories.Albert Visser - 2008 - Archive for Mathematical Logic 47 (4):299-326.
Modal Matters for Interpretability Logics.Evan Goris & Joost Joosten - 2008 - Logic Journal of the IGPL 16 (4):371-412.
Transductions in arithmetic.Albert Visser - 2016 - Annals of Pure and Applied Logic 167 (3):211-234.

View all 9 citations / Add more citations

References found in this work

The incompleteness theorems.Craig Smorynski - 1977 - In Jon Barwise (ed.), Handbook of Mathematical Logic. North-Holland. pp. 821 -- 865.
Logics for Conditionals.Frank Veltman - 1987 - Studia Logica 46 (2):206-207.
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.
Cuts, consistency statements and interpretations.Pavel Pudlák - 1985 - Journal of Symbolic Logic 50 (2):423-441.

View all 18 references / Add more references