A Topological Completeness Theorem for Transfinite Provability Logic
Logic
2019-05-07 v2
Abstract
We prove a topological completeness theorem for the modal logic GLP containing operators for Ord intended to capture progressively stronger notions of consistency in mathematical theories. We show that, given a scattered space of large-enough rank, any sentence consistent with GLP can be satisfied in a polytopological space based on the finitely many Icard topologies over that correspond to the finitely many modalities appearing in .
Cite
@article{arxiv.1609.03074,
title = {A Topological Completeness Theorem for Transfinite Provability Logic},
author = {Juan P. Aguilera},
journal= {arXiv preprint arXiv:1609.03074},
year = {2019}
}
Comments
32 pages