2000 character limit reached
Strong completeness of modal logics over 0-dimensional metric spaces
Published 9 May 2019 in math.LO and cs.LO | (1905.03477v2)
Abstract: We prove strong completeness results for some modal logics with the universal modality, with respect to their topological semantics over 0-dimensional dense-in-themselves metric spaces. We also use failure of compactness to show that, for some languages and spaces, no standard modal deductive system is strongly complete.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.