On topological models of GLP

Publication date

2009-08-10

Authors

Beklemishev, L.D.
Bezhanishvili, Guram
Icard, Thomas

Editors

Advisors

Supervisors

DOI

Document Type

Preprint
Open Access logo

License

Abstract

We develop topological semantics of a polymodal provability logic GLP. Our main result states that the bimodal fragment of GLP, although incomplete with respect to relational semantics, is topologically complete. The topological (in)completeness of GLP remains an interesting open problem.

Keywords

Citation