Since the early days of physics, space has called for means to represent, experiment, and reason about it. Apart from physicists, the concept of space has intrigued also philosophers, mathematicians and, more recently, computer scientists. This longstanding interest has left us with a plethora of mathematical tools developed to represent and work with space. Here we take a special look at this evolution by considering the perspective of Logic. From the initial axiomatic efforts of Euclid, we revisit the major milestones (...) in the logical representation of space and investigate current trends. In doing so, we do not only consider classical logic, but we indulge ourselves with modal logics. These present themselves naturally by providing simple axiomatizations of different geometries, topologies, space-time causality, and vector spaces. (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)

Abstract. Gettier’s famous examples intended to show that knowledge cannot always be equated with justified true belief. The Gettier problem can also be considered as a problem for topological epistemic logic: If knowledge and justified belief are conceived as topological operators K and B on topological spaces (to be considered as universes of possible worlds), one may ask whether it happens that there is a proposition A such that KA ≠ A & BA or not. If this is the case, (...) the epistemological logic defined by the topological operators K and B may be said to be non-traditional since there is for them a “Gettier proposition” where knowledge does not coincide with justified true belief. As far as we know, for the first time, this topological Gettier problem is discussed in Steinvold’s PhD dissertation (Steinsvold 2012). In Baltag, Bezhanishvili, Özgün, and Smets (2013), Steinvold’s co-derived set account is criticized since it can be easily “Gettierized”. Baltag et alii claim (without proof) that their topological account of Stalnaker’s logic KB of knowledge and belief does not have this flaw. In the following we will give some topological conditions that determine whether a topological KB model does or does not cope with the Gettier challenge. First, it will be shown that every KB model defines a (topologically slightly simplified) model that is rather similar to it but a is a model of traditional JTB (knowledge = justified true belief) logic of knowledge and belief. The existence of such doppelgangers of all KB models may be read as a qualified and partial topological rehabilitation of traditional JTB epistemology. Second, we consider the Gettier problem for a special class of models of Stalnaker’s combined logic of knowledge and belief KB, namely, for T0 Alexandroff spaces. We prove that, that almost all Alexandroff spaces do not face Gettier counterexamples. Third, we prove that the Stone spaces of Boolean algebras of regular closed subsets of Hausdorff (or T2) spaces X do not face Gettier counterexamples if the X are not pseu–docompact, and these Stone spaces do face Gettier counterexamples for compact spaces X. Succinctly formulated, Stalnaker’s KB logic of knowledge and belief can avoid Gettier problems for some models, while it falls back to traditional pre-Gettier JTB epistemology for other models. In contrast, co-derived set semantics is doomed to fail always in the sense that its models always fall prey to Gettier counterexamples. (shrink)