This paper concerns modal logics appearing from the temporal ordering of domains in two-dimensional Minkowski spacetime. As R. Goldblatt has proved recently, the logic of the whole plane isS4.2. We consider closed or open convex polygons and closed or open domains bounded by simple differentiable curves; this leads to the logics:S4,S4.1,S4.2 orS4.1.2.

We prove that each countable rooted K4 -frame is a d-morphic image of a subspace of the space $\mathbb{Q}$ of rational numbers. From this we derive that each modal logic over K4 axiomatizable by variable-free formulas is the d-logic of a subspace of $\mathbb{Q}$ . It follows that subspaces of $\mathbb{Q}$ give rise to continuum many d-logics over K4 , continuum many of which are neither finitely axiomatizable nor decidable. In addition, we exhibit several families of modal logics finitely axiomatizable (...) by variable-free formulas over K4 that d-define interesting classes of topological spaces. Each of these logics has the finite model property and is decidable. Finally, we introduce quasi-scattered and semi-scattered spaces as generalizations of scattered spaces, develop their basic properties, axiomatize their corresponding modal logics, and show that they also arise as the d-logics of some subspaces of $\mathbb{Q}$. (shrink)

Biró, B. and I. Sain, Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics, Annals of Pure and Applied Logic 63 201-225. We show that one can prove the partial correctness of more programs using Peano's axioms for the time frames of three-sorted time models than using only Presburger's axioms, that is it is useful to allow multiplication of time points at program verification and in dynamic and temporal logics. We organized the paper (...) as follows: 1. Preliminaries, 2. The main result, 3. Peano arithmetic with bounded multiplication, 4. Connections with temporal logics and dynamic logics, Acknowledgements, References. (shrink)