Abstract
Abstract
Assuming the existence of suitable large cardinals, we show it is consistent that the Provability logic
$\mathbf {GL}$
is complete with respect to the filter sequence of normal measures. This result answers a question of Andreas Blass from 1990 and a related question of Beklemishev and Joosten.
Publisher
Cambridge University Press (CUP)
Reference16 articles.
1. Topological completeness of the provability logic
$GLP$;Beklemishev;Annals of Pure and Applied Logic,2013
2. The structure of the Mitchell order-I;Ben-Neria;Israel Journal of Mathematics,2016
3. A topological completeness theorem for transfinite provability logic.;Aguilera;Archive for Mathematical Logic,2023
4. [10] Blass, A. , Infinitary combinatorics and modal logic, this Journal, vol. 55 (1990), no. 2, pp. 761–778.
5. Prikry-Type Forcings