Hostname: page-component-6898cfcb55-th4rj Total loading time: 0 Render date: 2026-11-11T21:43:10.043Z Has data issue: false hasContentIssue false

Interpretability over peano arithmetic

Published online by Cambridge University Press:  12 March 2014

Claes Strannegård*
Affiliation:
Department of Philosophy, Utrecht University, Heidelberglaan 8, 3584 Cs Utrecht, The Netherlands, E-mail: claes.strannegard@phil.uu.nl

Abstract

We investigate the modal logic of interpretability over Peano arithmetic. Our main result is a compactness theorem that extends the arithmetical completeness theorem for the interpretability logic ILMω. This extension concerns recursively enumerable sets of formulas of interpretability logic (rather than single formulas). As corollaries we obtain a uniform arithmetical completeness theorem for the interpretability logic ILM and a partial answer to a question of Orey from 1961. After some simplifications, we also obtain Shavrukov's embedding theorem for Magari algebras (a.k.a. diagonalizable algebras).

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable