The Interpretability Logic of all Reasonable Arithmetical Theories

Areces, C., D. de Jongh, and E. Hoogland: 1998, ‘The Interpolation Theorem for IL and ILP', in Proceedings of AiML98. Advances in Modal Logic, Uppsala, Sweden.

Bennet, C.: 1986, On Some Orderings of Extensions of Arithmetic, Department of Philosophy, University of Göteborg.

Berarducci, A.: 1990, ‘The Interpretability Logic of Peano Arithmetic', The Journal of Symbolic Logic 55, 1059–1089.

Berarducci, A. and R. Verbrugge: 1993, ‘On the Provability Logic of Bounded Arithmetic', Annals of Pure and Applied Logic 61, 75–93.

Buss, S.: 1986, Bounded Arithmetic, Bibliopolis, Napoli.

de Jongh, D. and F. Veltman: 1990, ‘Provability Logics for Relative Interpretability', in Petkov (ed.), Mathematical Logic, Proceedings of the Heygting 1988 Summer School in Varna, Bulgaria, Plenum Press, Boston, pp. 31–42.

de Jongh, D. and F. Veltman: 2000, ‘Modal Completeness of ILW', unpublished.

de Jongh, D. and A. Visser: 1991, ‘Explicit Fixed Points in Interpretability Logic', Studia Logica 50, 39–50.

de Rijke, M.: 1992, ‘Unary Interpretability Logic', The Notre Dame Journal of Formal Logic 33, 249–272.

Hájek, P. and P. Pudlák: 1991, Metamathematics of First-Order Arithmetic, Perspectives in Mathematical Logic. Springer, Berlin.

Iemhoff, R.: 2000, ‘A Modal Analysis of Some Principles of the Provability Logic of Heyting Arithmetic', in Proceedings of AiML'98, Vol. 2, Uppsala.

Japaridze, G. and D. de Jongh: 1998, ‘The Logic of Provability', in S. Buss (ed.), Handbook of Proof Theory, North-Holland, Amsterdam edn, pp. 475–546.

Joosten, J.: 1998, Towards the Interpretability Logic of All Reasonable Arithmetical Theories, Master's Thesis, ILLC, University of Amsterdam.

Lindström, P.: 1997, Aspects of Incompleteness, Vol. 10, Lecture Notes in Logic, Springer, Berlin.

Petkov, P.: (ed.) 1990, ‘Mathematical Logic, Proceedings of the Heyting 1988 Summer School in Varna, Bulgaria', Plenum Press, Boston.

Pudlák, P.: 1985, ‘Cuts, Consistency Statements and Interpretations', The Journal of Symbolic Logic 50, 423–441.

Shavrukov, V.: 1988, ‘The Logic of Relative Interpretability over Peano Arithmetic (in Russian)', Technical Report Report No. 5, Stekhlov Mathematical Institute, Moscow.

Shavrukov, V.: 1997, ‘Interpreting Reflexive Theories in Finitely Many Axioms', Fundamenta Mathematicae 152, 99–116.

Smory´nski, C.: 1977, ‘The Incompleteness Theorems', in J. Barwise (ed.), Handbook of Mathematical Logic. North-Holland, Amsterdam, pp. 821–865.

Solovay, R.: 1976, ‘On Interpretability in Set Theories', unpublished manuscript.

Švejdar, V.: 1978, ‘Degrees of Interpretability', Commentationes Mathematicae Universitatis Carolinae 19, 789–813.

Tarski, A., A. Mostowski, and R. Robinson: 1953, Undecidable Theories, North-Holland, Amsterdam.

Veltman, F.: 1985, ‘Logic for Conditionals', Ph.D. thesis, Department of Philosophy, University of Amsterdam.

Verbrugge, L.: 1993, Efficient Metamathematics. ILLC-disseration series 1993–3, Amsterdam.

Visser, A.: 1985, ‘Evaluation, Provably Deductive Equivalence in Heyting's Arithmetic of Substitution Instances of Propositional Formulas', Technical Report LGPS 4, Department of Philosophy, Utrecht University.

Visser, A.: 1990, ‘Interpretability Logic', in Petkov (ed.), Mathematical Logic, Proceedings of the Heygting 1988 Summer School in Varna, Bulgaria, pp. 175–209.

Visser, A.: 1991, ‘The Formalization of Interpretability', Studia Logica 51, 81–105.

Visser, A.: 1994, Propositional combinations of 6–sentences in Heyting's Arithmetic, Logic Group Preprint Series 117. Department of Philosophy, Utrecht University, Utrecht.

Visser, A.: 1998a, ‘An Overview of Interpretability Logic', in M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev (eds), Advances in Modal Logic, Vol 1, CSLI Lecture Notes, no. 87. Center for the Study of Language and Information, Stanford, CA, pp. 307–359.

Visser, A.: 1998b, ‘Rules and Arithmetics', Logic Group Preprint Series 186, Department of Philosophy, Utrecht University, Utrecht.

Visser, A., J. van Benthem, D. de Jongh, and G. R. de Lavalette: 1995, ‘NNIL, a Study in Intuitionistic Propositional Logic', in A. Ponse, M. de Rijke, and Y. Venema (eds), Modal Logic and Process Algebra, a Bisimulation Perspective, CSLI Lecture Notes, no. 53. Center for the Study of Language and Information, Stanford, CA, pp. 289–326.

Wilkie, A. and J. Paris: 1987, ‘On the Scheme of Induction for Bounded Arithmetic Formulas', Annals of Pure and Applied Logic 35, 261–302.

Zambella, D.: 1992, ‘On the Proofs of Arithmetical Completeness of Interpretability Logic', The Notre Dame Journal of Formal Logic 35, 542–551.