Abstract

The basic theorems of Provability Logic arethree in number. First is the Arithmetical Completeness
Theorem. The second place is shared by the theorems affirming the Uniqueness of Fixed Points and
the Explicit Definability of Fixed Points. In this paper we consider the problem of Uniqueness and:
Explicit Definability of Fixed Points for Interpretability
... read more
The basic theorems of Provability Logic arethree in number. First is the Arithmetical Completeness
Theorem. The second place is shared by the theorems affirming the Uniqueness of Fixed Points and
the Explicit Definability of Fixed Points. In this paper we consider the problem of Uniqueness and:
Explicit Definability of Fixed Points for Interpretability
... read more