Completeness of Pledger's modal logics of one-sorted projective and elliptic planes

Ken Pledger devised a one-sorted approach to the incidence relation of plane geometries, using structures that also support models of propositional modal logic. He introduced a modal system 12g that is valid in one-sorted projective planes, proved that it has finitely many non-equivalent modalities, and identified all possible modality patterns of its extensions. One of these extensions 8f is valid in elliptic planes. These results were presented in his doctoral dissertation. Here we show that 12g and 8f are strongly complete for validity in their intended one-sorted geometrical interpretations, and have the finite model property. The proofs apply standard technology of modal logic (canonical models, filtrations) together with a step-by-step procedure introduced by Yde Venema for constructing two-sorted projective planes

Completeness of Pledger’s modal logics of one-sorted projective and elliptic planes

Ken Pledger devised a one-sorted approach to the incidence relation of plane geometries, using structures that also support models of propositional modal logic. He introduced a modal system 12g that is valid in one-sorted projective planes, proved that it has finitely many non-equivalent modalities, and identified all possible modality patterns of its extensions. One of these extensions 8f is valid in elliptic planes. These results were presented in his 1980 doctoral dissertation, which is reprinted in this issue of the Australasian Journal of Logic. Here we show that 12g and 8f are strongly complete for validity in their intended one-sorted geometrical interpretations, and have the finite model property. The proofs apply standard technology of modal logic (canonical models, filtrations) together with a step-by-step procedure introduced by Yde Venema for constructing two-sorted projective planes

THE MODAL LOGIC OF AFFINE PLANES IS NOT FINITELY AXIOMATISABLE

Abstract. We consider a modal language for affine planes, with two sorts of formulas (for points and lines) and three modal diamonds. To evaluate formulas, we regard an affine plane as a Kripke frame with two sorts (points and lines) and three modal accessibility relations, namely the point-line and line-point incidence relations and the parallelism relation between lines. We show that the modal logic of affine planes in this language is not finitely axiomatisable. §1. Introduction. Recently the modal logics of space have began to draw considerable interest from logicians and computer scientists. See, e.g., [1]. Much of the interest seems to stem from the perceived use of modal logics for qualitative reasoning about spatial relations between objects, and the potential applications in computer science and knowledge representation