Extensions of the provability logic (Q793006)

The provability logic is defined by the calculus \({\mathfrak D}\), whose axioms are those of classical sentential calculus as well as the following three formulae: \((\Delta p\supset \Delta \Delta p), (\Delta(p\supset q)\supset(\Delta p\supset \Delta q)), (\Delta(\Delta p\supset p)\supset \Delta p).\) The rules of inference in \({\mathfrak D}\) are substitution, modus ponens, a/\(\Delta\) a and \(\Delta\) a/a. The algebraic interpretation of \({\mathfrak D}\) gives the infinite Magari's (or diagonalizable) algebras, since the validity of a formula \(\Delta\) a on such an algebra should lead to the validity on it of the formula a. It is proved that the set of all extensions of the calculus \({\mathfrak D}\) (i.e. the set of all formulae containing the axioms of \({\mathfrak D}\) and closed for all of its rules of inference) is of power \(2^{\aleph_ 0}\) and the set of all Magari's algebras, whose logic is an extension of \({\mathfrak D}\), is not a universal class.