Impossible worlds are regarded with understandable suspicion by most philosophers. Here we are concerned with a modal argument which might seem to show that acknowledging their existence, or more particularly, the existence of some hypothetical (we do not say “possible”) world in which everything was the case, would have drastic effects, forcing us to conclude that everything is indeed the case—and not just in the hypothesized world in question. The argument is inspired by a metaphysical (rather than modal-logical) argument of (...) Paul Kabay’s which would have us accept this unpalatable conclusion, though its details bear a closer resemblance to a line of thought developed by Jc Beall, in response to which Graham Priest has made some philosophical moves which are echoed in our diagnosis of what goes wrong with the present modal argument. Logical points of some interest independent of the main issue arise along the way. (shrink)

Viewing the language of modal logic as a language for describing directed graphs, a natural type of directed graph to study modally is one where the nodes are sets and the edge relation is the subset or superset relation. A well-known example from the literature on intuitionistic logic is the class of Medvedev frames $\langle W,R\rangle$ where $W$ is the set of nonempty subsets of some nonempty finite set $S$, and $xRy$ iff $x\supseteq y$, or more liberally, where $\langle W,R\rangle$ (...) is isomorphic as a directed graph to $\langle \wp(S)\setminus\{\emptyset\},\supseteq\rangle$. Prucnal [32] proved that the modal logic of Medvedev frames is not finitely axiomatizable. Here we continue the study of Medvedev frames with extended modal languages. Our results concern definability. We show that the class of Medvedev frames is definable by a formula in the language of tense logic, i.e., with a converse modality for quantifying over supersets in Medvedev frames, extended with any one of the following standard devices: nominals (for naming nodes), a difference modality (for quantifying over those $y$ such that $x\not= y$), or a complement modality (for quantifying over those $y$ such that $x\not\supseteq y$). It follows that either the logic of Medvedev frames in one of these tense languages is finitely axiomatizable---which would answer the open question of whether Medvedev's [31] "logic of finite problems'' is decidable---or else the minimal logics in these languages extended with our defining formulas are the beginnings of infinite sequences of frame-incomplete logics. (shrink)