The principles of interpretability (Q5937854)

The formal aspect of interpretability in arithmetic has been studied by means of modality by Hájek, Svejdar, and others similarly to the well-known modal representation of arithmetical provability established by Solovay. Visser introduced as one of such interpretability logics a bi-modal propositional logic of which one modality is that of provability and the other is a binary modality intended to represent the interpretability. The logic called IL provides a natural basic logic for the study but is not complete, that is, there are several modal formulas that are not provable in IL but are valid according to the natural arithemtical meaning. These formulas to be added as new axioms are called the principles of interpretability and the relationship between some of them has already been investigated by Svejdar and Visser on the base of IL. In this paper the author extends the investigation by determining the relationship between 10 principles of interpretability including those considered by Svejdar and Visser. The independence results between them are obtained by making use of generalized Veltman semantics developed by de Jongh.