Papers
Topics
Authors
Recent
Search
2000 character limit reached

A new version of an old modal incompleteness theorem

Published 15 Feb 2012 in math.LO | (1202.3268v1)

Abstract: Thomason \cite{Thomason74} showed that a certain modal logic $\mathbf{L}\subset \mathbf{S4}$ is incomplete with respect to Kripke semantics. Later Gerson \cite{Gerson75} showed that $\mathbf{L}$ is also incomplete with respect to neighborhood semantics. In this paper we show that $\mathbf{L}$ is in fact incomplete with respect to any class of complete Boolean algebras with operators, i.e. that it is completely incomplete.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.