We prove that S4 is complete with respect to Boolean combinations of countable unions of convex subsets of the real line, thus strengthening a 1944 result of McKinsey and Tarski 45 141). We also prove that the same result holds for the bimodal system S4+S5+C, which is a strengthening of a 1999 result of Shehtman 369).

It is a classic result (McKinsey & Tarski, 1944; Rasiowa & Sikorski, 1963) that if we interpret modal diamond as topological closure, then the modal logic of any dense-in-itself metric space is the well-known modal system S4. In this paper, as a natural follow-up, we study the modal logic of an arbitrary metric space. Our main result establishes that modal logics arising from metric spaces form the following chain which is order-isomorphic (with respect to the ⊃ relation) to the ordinalω+ (...) 3:$S4.Gr{z_1} \supset S4.Gr{z_2} \supset S4.Gr{z_3} \supset \cdots \,S4.Grz \supset S4.1 \supset S4.$It follows that the modal logic of an arbitrary metric space is finitely axiomatizable, has the finite model property, and hence is decidable. (shrink)

We investigate the major mathematical theories of space from a modal standpoint: topology, affine geometry, metric geometry, and vector algebra. This allows us to see new fine-structure in spatial patterns which suggests analogies across these mathematical theories in terms of modal, temporal, and conditional logics. Throughout the modal walk through space, expressive power is analyzed in terms of language design, bisimulations, and correspondence phenomena. The result is both unification across the areas visited, and the uncovering of interesting new questions.

When we interpret modal ◊ as the limit point operator of a topological space, the Gödel-Löb modal system GL defines the class Scat of scattered spaces. We give a partition of Scat into α-slices S α , where α ranges over all ordinals. This provides topological completeness and definability results for extensions of GL. In particular, we axiomatize the modal logic of each ordinal α, thus obtaining a simple proof of the Abashidze–Blass theorem. On the other hand, when we interpret (...) ◊ as closure in a topological space, the Grzegorczyk modal system Grz defines the class HI of hereditarily irresolvable spaces. We also give a partition of HI into α-slices H α , where α ranges over all ordinals. For a subset A of a hereditarily irresolvable space X and an ordinal α, we introduce the α-representation of A, give an axiomatization of the α-representation of A, and characterize H α in terms of α-representations. We prove that ${X \in {\bf H}_{1}}$ iff X is submaximal. For a positive integer n, we generalize the notion of a submaximal space to that of an n-submaximal space, and prove that ${X \in {\bf H}_{n}}$ iff X is n-submaximal. This provides topological completeness and definability results for extensions of Grz. We show that the two partitions are related to each other as follows. For a successor ordinal α = β + n, with β a limit ordinal and n a positive integer, we have ${{\bf H}_{\alpha} \cap {\bf Scat} = {\bf S}_{\beta+2n-1} \cup {\bf S}_{\beta+2n}}$ , and for a limit ordinal α, we have ${{\bf H}_{\alpha} \cap {\bf Scat} = {\bf S}_{\alpha}}$ . As a result, we obtain full and faithful translations of ordinal complete extensions of Grz into ordinal complete extensions of GL, thus generalizing the Kuznetsov–Goldblatt–Boolos theorem. (shrink)

We investigate a recently devised polyhedral semantics for intermediate logics, in which formulas are interpreted in n-dimensional polyhedra. An intermediate logic is polyhedrally complete if it is complete with respect to some class of polyhedra. The first main result of this paper is a necessary and sufficient condition for the polyhedral completeness of a logic. This condition, which we call the Nerve Criterion, is expressed in terms of Alexandrov’s notion of the nerve of a poset. It affords a purely combinatorial (...) characterisation of polyhedrally complete logics. Using the Nerve Criterion we show, easily, that there are continuum many intermediate logics that are not polyhedrally complete but which have the finite model property. We also provide, at considerable combinatorial labour, a countably infinite class of logics axiomatised by the Jankov–Fine formulas of ‘starlike trees’ all of which are polyhedrally complete. The polyhedral completeness theorem for these ‘starlike logics’ is the second main result of this paper. (shrink)

Let ${\beta(\mathbb{N})}$ denote the Stone–Čech compactification of the set ${\mathbb{N}}$ of natural numbers (with the discrete topology), and let ${\mathbb{N}^\ast}$ denote the remainder ${\beta(\mathbb{N})-\mathbb{N}}$ . We show that, interpreting modal diamond as the closure in a topological space, the modal logic of ${\mathbb{N}^\ast}$ is S4 and that the modal logic of ${\beta(\mathbb{N})}$ is S4.1.2.

We prove that the existence of a measurable cardinal is equivalent to the existence of a normal space whose modal logic coincides with the modal logic of the Kripke frame isomorphic to the powerset of a two element set.

We prove that the existence of a measurable cardinal is equivalent to the existence of a normal space whose modal logic coincides with the modal logic of the Kripke frame isomorphic to the powerset of a two element set.

We introduce the concept of a connected logic (over S4) and show that each connected logic with the finite model property is the logic of a subalgebra of the closure algebra of all subsets of the real line R, thus generalizing the McKinsey-Tarski theorem. As a consequence, we obtain that each intermediate logic with the finite model property is the logic of a subalgebra of the Heyting algebra of all open subsets of R.

This chapter presents a new semantics for inductive empirical knowledge. The epistemic agent is represented concretely as a learner who processes new inputs through time and who forms new beliefs from those inputs by means of a concrete, computable learning program. The agent’s belief state is represented hyper-intensionally as a set of time-indexed sentences. Knowledge is interpreted as avoidance of error in the limit and as having converged to true belief from the present time onward. Familiar topics are re-examined within (...) the semantics, such as inductive skepticism, the logic of discovery, Duhem’s problem, the articulation of theories by auxiliary hypotheses, the role of serendipity in scientific knowledge, Fitch’s paradox, deductive closure of knowability, whether one can know inductively that one knows inductively, whether one can know inductively that one does not know inductively, and whether expert instruction can spread common inductive knowledge—as opposed to mere, true belief—through a community of gullible pupils. (shrink)

It is a celebrated result of McKinsey and Tarski [28] thatS4is the logic of the closure algebraΧ+over any dense-in-itself separable metrizable space. In particular,S4is the logic of the closure algebra over the realsR, the rationalsQ, or the Cantor spaceC. By [5], each logic aboveS4that has the finite model property is the logic of a subalgebra ofQ+, as well as the logic of a subalgebra ofC+. This is no longer true forR, and the main result of [5] states that each connected (...) logic aboveS4with the finite model property is the logic of a subalgebra of the closure algebraR+.In this paper we extend these results to all logics aboveS4. Namely, for a normal modal logicL, we prove that the following conditions are equivalent: (i)Lis aboveS4, (ii)Lis the logic of a subalgebra ofQ+, (iii)Lis the logic of a subalgebra ofC+. We introduce the concept of a well-connected logic aboveS4and prove that the following conditions are equivalent: (i)Lis a well-connected logic, (ii)Lis the logic of a subalgebra of the closure algebra$\xi _2^ + $over the infinite binary tree, (iii)Lis the logic of a subalgebra of the closure algebra${\bf{L}}_2^ + $over the infinite binary tree with limits equipped with the Scott topology. Finally, we prove that a logicLaboveS4is connected iffLis the logic of a subalgebra ofR+, and transfer our results to the setting of intermediate logics.Proving these general completeness results requires new tools. We introduce the countable general frame property (CGFP) and prove that each normal modal logic has the CGFP. We introduce general topological semantics forS4, which generalizes topological semantics the same way general frame semantics generalizes Kripke semantics. We prove that the categories of descriptive frames forS4and descriptive spaces are isomorphic. It follows that every logic aboveS4is complete with respect to the corresponding class of descriptive spaces. We provide several ways of realizing the infinite binary tree with limits, and prove that when equipped with the Scott topology, it is an interior image of bothCandR. Finally, we introduce gluing of general spaces and prove that the space obtained by appropriate gluing involving certain quotients ofL2is an interior image ofR. (shrink)

We prove that S4 is complete with respect to Boolean combinations of countable unions of convex subsets of the real line, thus strengthening a 1944 result of McKinsey and Tarski 45 141). We also prove that the same result holds for the bimodal system S4+S5+C, which is a strengthening of a 1999 result of Shehtman 369).

This book illustrates the program of Logical-Informational Dynamics. Rational agents exploit the information available in the world in delicate ways, adopt a wide range of epistemic attitudes, and in that process, constantly change the world itself. Logical-Informational Dynamics is about logical systems putting such activities at center stage, focusing on the events by which we acquire information and change attitudes. Its contributions show many current logics of information and change at work, often in multi-agent settings where social behavior is essential, (...) and often stressing Johan van Benthem's pioneering work in establishing this program. However, this is not a Festschrift, but a rich tapestry for a field with a wealth of strands of its own. The reader will see the state of the art in such topics as information update, belief change, preference, learning over time, and strategic interaction in games. Moreover, no tight boundary has been enforced, and some chapters add more general mathematical or philosophical foundations or links to current trends in computer science. The theme of this book lies at the interface of many disciplines. Logic is the main methodology, but the various chapters cross easily between mathematics, computer science, philosophy, linguistics, cognitive and social sciences, while also ranging from pure theory to empirical work. Accordingly, the authors of this book represent a wide variety of original thinkers from different research communities. And their interconnected themes challenge at the same time how we think of logic, philosophy and computation. Thus, very much in line with van Benthem's work over many decades, the volume shows how all these disciplines form a natural unity in the perspective of dynamic logicians (broadly conceived) exploring their new themes today. And at the same time, in doing so, it offers a broader conception of logic with a certain grandeur, moving its horizons beyond the traditional study of consequence relations. (shrink)