I discuss some questions of quantum physics, for instance the validity and limitations of the basic language of set theory to deal with problems related to elementary particles. I also present a sketch of a formalization of a “metaphysics of structures”, which might be useful for a kind of “ontic structural realism”, and briefly review the concept of quasi-truth, which underlies my way of understanding scientific theories and the scientific activity.

The aim of this paper is to show that every topological space gives rise to a wealth of topological models of the modal logic S4.1. The construction of these models is based on the fact that every space defines a Boolean closure algebra (to be called a McKinsey algebra) that neatly reflects the structure of the modal system S4.1. It is shown that the class of topological models based on McKinsey algebras contains a canonical model that can be used to (...) prove a completeness theorem for S4.1. Further, it is shown that the McKinsey algebra MKX of a space X endoewed with an alpha-topologiy satisfies Esakia's GRZ axiom. (shrink)

In this paper it is shown that Heyting and Co-Heyting mereological systems provide a convenient conceptual framework for spatial reasoning, in which spatial concepts such as connectedness, interior parts, (exterior) contact, and boundary can be defined in a natural and intuitively appealing way. This fact refutes the wide-spread contention that mereology cannot deal with the more advanced aspects of spatial reasoning and therefore has to be enhanced by further non-mereological concepts to overcome its congenital limitations. The allegedly unmereological concept of (...) boundary is treated in detail and shown to be essentially affected by mereological considerations. More precisely, the concept of boundary turns out to be realizable in a variety of different mereologically grounded versions. In particular, every part K of a Heyting algebra H gives rise to a well-behaved K-relative boundary operator. (shrink)

According to David Lewis's extreme modal realism, every waythat a world could be is a way that some concretely existingphysical world really is. But if the worlds are physicalentities, then there should be a set of all worlds, whereasI show that in fact the collection of all possible worlds is nota set. The latter conclusion remains true even outside of theLewisian framework.

We introduce the horizontal and vertical topologies on the product of topological spaces, and study their relationship with the standard product topology. We show that the modal logic of products of topological spaces with horizontal and vertical topologies is the fusion S4 ⊕ S4. We axiomatize the modal logic of products of spaces with horizontal, vertical, and standard product topologies.We prove that both of these logics are complete for the product of rational numbers ℚ × ℚ with the appropriate topologies.

Using two distinct membership symbols makes possible to base set theory on one general axiom schema of comprehension. Is the resulting system consistent? Can set theory and mathematics be based on a single axiom schema of comprehension?

Though my ultimate concern is with issues in epistemology and metaphysics, let me phrase the central question I will pursue in terms evocative of philosophy of religion: What are the implications of our logic-in particular, of Cantor and G6del-for the possibility of omniscience?

Abstract. Traditional epistemology of knowledge and belief can be succinctly characterized as JTB-epistemology, i.e., it is characterized by the thesis that knowledge is justified true belief. Since Gettier’s trail-blazing paper of 1963 this account has become under heavy attack. The aim of is paper is to study the Gettier problem and related issues in the framework of topological epistemic logic. It is shown that in the framework of topological epistemic logic Gettier situations necessarily occur for most topological models of knowledge (...) and belief. On the other hand, there exists a special class of topological models (based on so called nodec spaces) for which traditional JTB-epistemology is valid. Further, it is shown that for each topological model of Stalnaker’s combined logic KB of knowledge and belief a canonical JTB-model (its JTB-doppelganger) can be constructed that shares many structural properties with the original model but is free of Gettier situations. The topological model and its JTB-doppelganger both share the same justified belief operator and have very similar knowledge operators. Seen from a somewhat different perspective, the JTB-account of epistemology amounts to a simplification of a more general epistemological account of knowledge and belief that assumes that these two concepts may differ in some cases. The JTB-account of knowledge and belief assumes that the epistemic agent’s cognitive powers are rather large. Thereby in the JTB-epistemology Gettier cases do not occur. Eventually, it is shown that for all topological models of Stalnaker’s KB-logic Gettier situations are topologically characterized as nowhere dense situations. This entails that Gettier situations are epistemologically invisible in the sense that they can neither be known nor believed with justification with respect to the knowledge operator and the belief operator of the models involved. (shrink)

The aim of this paper is to present a topological method for constructing discretizations of topological conceptual spaces. The method works for a class of topological spaces that the Russian mathematician Pavel Alexandroff defined more than 80 years ago. The aim of this paper is to show that Alexandroff spaces, as they are called today, have many interesting properties that can be used to explicate and clarify a variety of problems in philosophy, cognitive science, and related disciplines. For instance, recently, (...) Ian Rumfitt used a special type of Alexandroff spaces to elucidate the logic of vague concepts in a new way. Moreover, Rumfitt’s class of Alexandroff spaces can be shown to provide a natural topological semantics for Susanne Bobzien’s “logic of clearness”. Mainly due to the work of Peter Gärdenfors and his collaborators, conceptual spaces have become an increasingly popular tool of dealing with a variety of problems in the fields of cognitive psychology, artificial intelligence, linguistics and philosophy. For Gärdenfors’s conceptual spaces, geometrically defined discretizations play an essential role. These tessellations can be shown to be extensionally equivalent to topological tessellations that can be constructed for Alexandroff spaces in general. Thereby, Rumfitt’s and Gärdenfors’s constructions turn out to be special cases of an approach that works for a more general class of spaces, namely, for weakly scattered Alexandroff spaces. The main aim of this paper is to show that this class of spaces provides a convenient framework for conceptual spaces as used in epistemology and related disciplines in general. Weakly scattered Alexandroff spaces are useful for elucidating problems related to the logic of vague concepts, in particular they offer a solution of the Sorites paradox. Further, they provide a semantics for the logic of clearness that overcomes certain problems of the concept of higher-order vagueness. Moreover, these spaces help find a natural place for classical syllogistics in the framework of conceptual spaces. The specialization order of Alexandroff spaces can be used to refine the all-or-nothing distinction between prototypical and non-prototypical stimuli in favor of a gradual distinction between more or less prototypical elements of conceptual spaces. The greater conceptual flexibility of the topological approach helps avoid some inherent inadequacies of the geometrical approach, for instance, the so-called “thickness problem”. Finally, it is shown that the Alexandroff spaces offer an appropriate framework to deal with digital conceptual spaces that are gaining more and more importance in the areas of artificial intelligence, computer science and related disciplines. (shrink)

Abstract. The aim of this paper is to present a topological method for constructing discretizations (tessellations) of conceptual spaces. The method works for a class of topological spaces that the Russian mathematician Pavel Alexandroff defined more than 80 years ago. Alexandroff spaces, as they are called today, have many interesting properties that distinguish them from other topological spaces. In particular, they exhibit a 1-1 correspondence between their specialization orders and their topological structures. Recently, a special type of Alexandroff spaces was (...) used by Ian Rumfitt to elucidate the logic of vague concepts in a new way. According to his approach, conceptual spaces such as the color spectrum give rise to classical systems of concepts that have the structure of atomic Boolean algebras. More precisely, concepts are represented as regular open regions of an underlying conceptual space endowed with a topological structure. Something is subsumed under a concept iff it is represented by an element of the conceptual space that is maximally close to the prototypical element p that defines that concept. This topological representation of concepts comes along with a representation of the familiar logical connectives of Aristotelian syllogistics in terms of natural settheoretical operations that characterize regular open interpretations of classical Boolean propositional logic. In the last 20 years, conceptual spaces have become a popular tool of dealing with a variety of problems in the fields of cognitive psychology, artificial intelligence, linguistics and philosophy, mainly due to the work of Peter Gärdenfors and his collaborators. By using prototypes and metrics of similarity spaces, one obtains geometrical discretizations of conceptual spaces by so-called Voronoi tessellations. These tessellations are extensionally equivalent to topological tessellations that can be constructed for Alexandroff spaces. Thereby, Rumfitt’s and Gärdenfors’s constructions turn out to be special cases of an approach that works for a more general class of spaces, namely, for weakly scattered Alexandroff spaces. This class of spaces provides a convenient framework for conceptual spaces as used in epistemology and related disciplines in general. Alexandroff spaces are useful for elucidating problems related to the logic of vague concepts, in particular they offer a solution of the Sorites paradox (Rumfitt). Further, they provide a semantics for the logic of clearness (Bobzien) that overcomes certain problems of the concept of higher2 order vagueness. Moreover, these spaces help find a natural place for classical syllogistics in the framework of conceptual spaces. The crucial role of order theory for Alexandroff spaces can be used to refine the all-or-nothing distinction between prototypical and nonprototypical stimuli in favor of a more fine-grained gradual distinction between more-orless prototypical elements of conceptual spaces. The greater conceptual flexibility of the topological approach helps avoid some inherent inadequacies of the geometrical approach, for instance, the so-called “thickness problem” (Douven et al.) and problems of selecting a unique metric for similarity spaces. Finally, it is shown that only the Alexandroff account can deal with an issue that is gaining more and more importance for the theory of conceptual spaces, namely, the role that digital conceptual spaces play in the area of artificial intelligence, computer science and related disciplines. Keywords: Conceptual Spaces, Polar Spaces, Alexandroff Spaces, Prototypes, Topological Tessellations, Voronoi Tessellations, Digital Topology. (shrink)

The classical theory of definitions bans so-called circular definitions, namely, definitions of a unary predicate P, based on stipulations of the form $$Px =_{\mathsf {Df}} \phi,$$where ϕ is a formula of a fixed first-order language and the definiendumP occurs into the definiensϕ. In their seminal book The Revision Theory of Truth, Gupta and Belnap claim that “General theories of definitions are possible within which circular definitions [...] make logical and semantic sense” [p. IX]. In order to sustain their claim, they (...) develop in this book one general theory of definitions based on revision sequences, namely, ordinal-length iterations of the operator which is induced by the definition of the predicate. Gupta-Belnap’s approach to circular definitions has been criticised, among others, by D. Martin and V. McGee. Their criticisms point to the logical complexity of revision sequences, to their relations with ordinary mathematical practice, and to their merits relative to alternative approaches. I will present an alternative general theory of definitions, based on a combination of supervaluation and ω-length revision, which aims to address some criticisms raised against revision sequences, while preserving the philosophical and mathematical core of revision. (shrink)

The aim of this paper is to elucidate the relationship between Aristotelian conceptual oppositions, commutative diagrams of relational structures, and Galois connections.This is done by investigating in detail some examples of Aristotelian conceptual oppositions arising from topological spaces and similarity structures. The main technical device for this endeavor is the notion of Galois connections of order structures.

The Wadge hierarchy was originally defined and studied only in the Baire space. Here we extend the Wadge hierarchy of Borel sets to arbitrary topological spaces by providing a set-theoretic definition of all its levels. We show that our extension behaves well in second countable spaces and especially in quasi-Polish spaces. In particular, all levels are preserved by continuous open surjections between second countable spaces which implies e.g., several Hausdorff–Kuratowski -type theorems in quasi-Polish spaces. In fact, many results hold not (...) only for the Wadge hierarchy of sets but also for its extension to Borel functions from a space to a countable better quasiorder Q. (shrink)

The wedge hierarchy was originally defined and studied only in the Baire space (and some other zero-dimensional spaces). Here we extend the Wadge hierarchy of Borel sets to arbitrary topological spaces by providing a set-theoretic definition of all its levels. We show that our extension behaves well in second countable spaces and especially in quasi-Polish spaces. In particular, all levels are preserved by continuous open surjections between second countable spaces which implies e.g. several Hausdorff-Kuratowski-type theorems in quasi-Polish spaces. In fact, (...) many results hold not only for the Wadge hierarchy of sets but also for its extension to Borel functions from a space to a countable better quasiorder Q. (shrink)

König, D. [1926. ‘Sur les correspondances multivoques des ensembles’, Fundamenta Mathematica, 8, 114–34] includes a result subsequently called König's Infinity Lemma. Konig, D. [1927. ‘Über eine Schlussweise aus dem Endlichen ins Unendliche’, Acta Litterarum ac Scientiarum, Szeged, 3, 121–30] includes a graph theoretic formulation: an infinite, locally finite and connected graph includes an infinite path. Contemporary applications of the infinity lemma in logic frequently refer to a consequence of the infinity lemma: an infinite, locally finite tree with a root has (...) a infinite branch. This tree lemma can be traced to [Beth, E. W. 1955. ‘Semantic entailment and formal derivability’, Mededelingen der Kon. Ned. Akad. v. Wet., new series 18, 13, 309–42]. It is argued that Beth independently discovered the tree lemma in the early 1950s and that it was later recognized among logicians that Beth's result was a consequence of the infinity lemma. The equivalence of these lemmas is an easy consequence of a well known result in graph theory: every connected, locally finite graph has among its partial subgraphs a spanning tree. (shrink)

The paper is the Part IV of the large research, dedicated to both revision of the system of basic logical categories and generalization of modern predicate logic to functional logic. The topic of the paper is consideration of graphs of functions and relations as a derivative and definable category of ultra-Fregean logistics. There are two types of function specification: an operational specification, in which a function is first applied to arguments and then the value of the function is entered as (...) the result of such application, and a grammar specification, in which an object is first entered and then represented as a value of the function on the given arguments. Since function specifications are relations themselves (which was shown in the previous article of the series), this means that each function forms two relations: the obverse (for an operational specification) and the reverse one (for a grammatical specification). Hence, the definitions introduce two types of graphs: the obverse graph of a function, or a graph of the obverse relation formed by this function, is a set of sequences of such objects, the last of which is a value of this function on the sequence of other of these objects as arguments of the same function. Similarly, the reverse graph of a function, or the graph of the reverse relation formed by this function, is called a set of sequences of such objects, the first of which is the value of this function on the sequence of other of these objects as arguments of the same function. In the limiting case of 0-ary functions, both graphs of any such function coincide. Gottlob Frege discovered obverse graphs of functions and called them function value-ranges. He fundamentally emphasized the non-identity of functions and their graphs. Unfortunately, in set theory under the influence of Giuseppe Peano, an alternative approach was adopted, according to which functions and relations are identical to their graphs and, ultimately, to each other. We show that this approach leads to two unacceptable and, at the same time, mutually contradictory conclusions, and must therefore be rejected. (shrink)