In this paper we develop a point-free approach to the study of topological spaces and functions on them, establish platforms for both and present some findings on recursive points. In the first sections of the paper, we obtain conditions under which our approach leads to the generation of ideal objects with which mathematicians work. Next, we apply the effective version of our approach to the real numbers, and make exact connections to the classical approach to recursive reals. In (...) the succeeding sections of the paper, we introduce machinery to produce functions on topological spaces and find succinct conditions which will be effectivized in our sequel. (shrink)

This is the first, out of two papers, devoted to Andrzej Grzegorczyk’s point-free system of topology from Grzegorczyk :228–235, 1960. https://doi.org/10.1007/BF00485101). His system was one of the very first fully fledged axiomatizations of topology based on the notions of region, parthood and separation. Its peculiar and interesting feature is the definition of point, whose intention is to grasp our geometrical intuitions of points as systems of shrinking regions of space. In this part we analyze separation (...) structures and Grzegorczyk structures, and establish their properties which will be useful in the sequel. We prove that in the class of Urysohn spaces with countable chain condition, to every topologically interpreted representative of a point in the sense of Grzegorczyk’s corresponds exactly one point of a space. We also demonstrate that Tychonoff first-countable spaces give rise to complete Grzegorczyk structures. The results established below will be used in the second part devoted to points and topological spaces. (shrink)

In the second installment to Gruszczyński and Pietruszczak we carry out an analysis of spaces of points of Grzegorczyk structures. At the outset we introduce notions of a concentric and \-concentric topological space and we recollect some facts proven in the first part which are important for the sequel. Theorem 2.9 is a strengthening of Theorem 5.13, as we obtain stronger conclusion weakening Tychonoff separation axiom to mere regularity. This leads to a stronger version of Theorem 6.10. Further, we show (...) that Grzegorczyk points are maximal contracting filters in the sense of De Vries, but the converse inclusion is not necessarily true. We also compare the notions of a Grzegorczyk point and an ultrafilter, and establish several properties of topological spaces based on Grzegorczyk structures. The main results of the paper are representation and completion theorems for G-structures. We prove both set-theoretical and topological representation theorems for various classes of G-structures. We also present topological object duality theorem for the class of complete G-structures and the class of concentric spaces, both restricted to structures which satisfy countable chain condition. We conclude the paper with proving equivalence of the original Grzegorczyk axiom with the one accepted by us as axiom. (shrink)

This is a spin-off paper to [3, 4] in which we carried out an extensive analysis of Andrzej Grzegorczyk’s point-free topology from [5]. In [1] Loredana Biacino and Giangiacomo Gerla presented an axiomatization which was inspired by the Grzegorczyk’s system, and which is its variation. Our aim is to compare the two approaches and show that they are slightly different. Except for pointing to dissimilarities, we also demonstrate that the theories coincide in presence of axiom stipulating non-existence (...) of atoms. (shrink)

In the first section we briefly describe methodological assumptions of point-free geometry and topology. We also outline history of geometrical theories based on the notion of emph{region}. The second section is devoted to concise presentation of the content of the LLP special issue on point-free theories of space.

In this note a T1 formal space is a formal space whose points are closed as subspaces. Any regular formal space is T1. We introduce the more general notion of a formal space, and prove that the class of points of a weakly set-presentable formal space is a set in the constructive set theory CZF. The same also holds in constructive type theory. We then formulate separation properties for constructive topological spaces , strengthening separation properties discussed elsewhere. Finally we relate (...) the properties for ct-spaces with corresponding properties of formal spaces. (shrink)

This article is devoted to the problem of ontological foundations of three-dimensional Euclidean geometry. Starting from Bertrand Russell’s intuitions concerning the sensual world we try to show that it is possible to build a foundation for pure geometry by means of the so called regions of space. It is not our intention to present mathematically developed theory, but rather demonstrate basic assumptions, tools and techniques that are used in construction of systems of point-free geometry and topology by (...) means of mereology and Whitehead-like connection structures. We list and briefly analyze axioms for mereological structures, as well as those for connection structures. We argue that mereology is a good tool to model so called spatial relations. We also try to justify our choice of axioms for connection relation. Finally, we briefly discuss two theories: Grzegorczyk’s point-free topology and Tarski’s geometry of solids. (shrink)

The standard presentation of topological spaces relies heavily on (naïve) set theory: a topology consists of a set of subsets of a set (of points). And many of the high-level tools of set theory are required to achieve just the basic results about topological spaces. Concentrating on the mathematical structures, category theory offers the possibility to look synthetically at the structure of continuous transformations between topological spaces addressing specifically how the fundamental notions of point and open come about. (...) As a byproduct of this, one may look at the different approaches to topology from an external perspective and compare them in a unified way. Technically, the category of sober topological spaces can be seen as consisting of (co)algebraic structures in the exact completion of the elementary category of sets and relations. Moreover, the same abstract construction of taking the exact completion, when applied to the category of topological spaces and continuous functions produces an extension of it which is cartesian closed. In other words, there is one general mathematical construction that, when applied to a very elementary category, generates the category of topological spaces and continuous functions, and when applied to that category produces a very suitable category where to deal with all sorts functions spaces. Yet, via such free constructions it is possible to give a new meaning to Marshall Stone’s dictum: “always topologize” as the category of sets and relations is the most natural way to give structure to logic and the category of topological spaces and continuous functions is obtained from it by a good mix of free – i.e. syntactic – constructions. (shrink)

A general method for constructing a new class of topological Ramsey spaces is presented. Members of such spaces are infinite sequences of products of Fraïssé classes of finite relational structures satisfying the Ramsey property. The Product Ramsey Theorem of Sokič is extended to equivalence relations for finite products of structures from Fraïssé classes of finite relational structures satisfying the Ramsey property and the Order-Prescribed Free Amalgamation Property. This is essential to proving Ramsey-classification theorems for equivalence relations on fronts, generalizing (...) the Pudlák–Rödl Theorem to this class of topological Ramsey spaces. To each topological Ramsey space in this framework corresponds an associated ultrafilter satisfying some weak partition property. By using the correct Fraïssé classes, we construct topological Ramsey spaces which are dense in the partial orders of Baumgartner and Taylor generating p-points which are k-arrow but not \-arrow, and in a partial order of Blass producing a diamond shape in the Rudin-Keisler structure of p-points. Any space in our framework in which blocks are products of n many structures produces ultrafilters with initial Tukey structure exactly the Boolean algebra \\). If the number of Fraïssé classes on each block grows without bound, then the Tukey types of the p-points below the space’s associated ultrafilter have the structure exactly \. In contrast, the set of isomorphism types of any product of finitely many Fraïssé classes of finite relational structures satisfying the Ramsey property and the OPFAP, partially ordered by embedding, is realized as the initial Rudin-Keisler structure of some p-point generated by a space constructed from our template. (shrink)

This paper continues our study of computable point-free topological spaces and the metamathematical points in them. For us, a point is the intersection of a sequence of basic open sets with compact and nested closures. We call such a sequence a sharp filter. A function fF from points to points is generated by a function F from basic open sets to basic open sets such that sharp filters map to sharp filters. We restrict our study to functions (...) that have at least all computable points in their domains.We follow Turing's approach in stating that a point is computable if it is the limit of a computable sharp filter; we then define the Turing degree Deg of a general point x in an analogous way. Because of the vagaries of the definition, a result of J. Miller applies and we note that not all points in all our spaces have Turing degrees; but we also show a certain class of points do. We further show that in ℝn all points have Turing degrees and that these degrees are the same as the classical Turing degrees of points defined by other researchers.We also prove the following: For a point x that has a Turing degree and lies either on a computable tree T or in the domain of a computable function fF, there is a sharp filter on T or in dom converging to x and with the same Turing degree as x. Furthermore, all possible Turing degrees occur among the degrees of such points for a given computable function fF or a complete, computable, binary tree T. For each x ∈ dom for which x and fF have Turing degrees, Deg) ≤ Deg. Finally, the Turing degrees of the sharp filters convergent to a given x are closed upward in the partial order of all Turing degrees. (shrink)

Let be a countable first order structure and endow the universe of with the discrete topology. Then the automorphism group of becomes a topological group. A tuple of automorphisms is defined to be weakly generic iff its diagonal conjugacy class (in the algebraic sense) is dense (in the topological sense) and the ‐orbit of each is finite. Existence of tuples of weakly generic automorphisms are interesting from the point of view of model theory as well as from the (...) point of view of finite combinatorics.The main results of the present work are as follows. In Theorem 2.6 we characterize the existence of tuples of weakly generic automorphisms with the aid of the profinite topology of free groups. In Corollary 2.12 we will show that if has finite topological rank r (and satisfies a further, mild technical condition) then the existence of a weakly generic tuple in implies the existence of weakly generic tuples in for all natural number. Finally, in Theorem 3.2 we show that if is a countable model of an ℵ0‐categorical, simple theory in which all types over the empty set are stationary and has a pair of weakly generic automorphisms then it has tuples of weakly generic automorphisms of arbitrary finite length.At the technical level we will combine elementary investigations about the profinite topology of free groups with the results of [11] about topological ranks of the automorphism groups of some structures. (shrink)

Given a model-complete theory of topological fields, we considered its generic differential expansions and under a certain hypothesis of largeness, we axiomatised the class of existentially closed ones. Here we show that a density result for definable types over definably closed subsets in such differential topological fields. Then we show two transfer results, one on the VC-density and the other one, on the combinatorial property NTP2.

We consider first-order theories of topological fields admitting a model-completion and their expansion to differential fields . We give a criterion under which the expansion still admits a model-completion which we axiomatize. It generalizes previous results due to M. Singer for ordered differential fields and of C. Michaux for valued differential fields. As a corollary, we show a transfer result for the NIP property. We also give a geometrical axiomatization of that model-completion. Then, for certain differential valued fields, we extend (...) the positive answer of Hilbert’s seventeenth problem and we prove an Ax–Kochen–Ershov theorem. Similarly, we consider first-order theories of topological fields admitting a model-companion and their expansion to differential fields, and under a similar criterion as before, we show that the expansion still admits a model-companion. This last result can be compared with those of M. Tressl: on one hand we are only dealing with a single derivation whereas he is dealing with several, on the other hand we are not restricting ourselves to definable expansions of the ring language, taking advantage of our topological context. We apply our results to fields endowed with several valuations. (shrink)

We construct a fibered dimension function in some topological differential fields.

The first aim of this paper is to prove a topological completeness theorem for a weak version of Stalnaker’s logic KB of knowledge and belief. The weak version of KB is characterized by the assumption that the axioms and rules of KB have to be satisfied with the exception of the axiom (NI) of negative introspection. The proof of a topological completeness theorem for weak KB is based on the fact that nuclei (as defined in the framework of point- (...) class='Hi'>free topology) give rise to a profusion of topological belief operators that are compatible with the familiar topological knowledge operator. Thereby a canonical topological model for weak KB can be constructed. For this canonical model a truth lemma for the K and B holds such that a completeness theorem for KB can be proved in the familiar way. The second aim of this paper is to show that the topological interpretation of knowledge K comes along with a complete Heyting algebra of belief operators B that all fit the knowledge operator K in the sense that the pairs (K, B) satisfy all axioms of weak KB. This amounts to a pluralistic relation between knowledge and belief: Knowledge does not fully determine belief, rather it designs a conceptual space for belief operators where different (competing) belief operators coexist. (shrink)

The purpose of this paper is to compare the notion of a Grzegorczyk point introduced in [19] (and thoroughly investigated in [3, 14, 16, 18]) to the standard notions of a filter in Boolean algebras and round filter in Boolean contact algebras. In particular, we compare Grzegorczyk points to filters and ultrafilters of atomic and atomless algebras. We also prove how a certain extra axiom influences topological spaces for Grzegorczyk contact algebras. Last but not least, we do not refrain (...) from a philosophical interpretation of the results from the paper. (shrink)

The standard topological representation of a Boolean algebra via the clopen sets of a Stone space requires a nonconstructive choice principle, equivalent to the Boolean Prime Ideal Theorem. In this article, we describe a choice-free topological representation of Boolean algebras. This representation uses a subclass of the spectral spaces that Stone used in his representation of distributive lattices via compact open sets. It also takes advantage of Tarski’s observation that the regular open sets of any topological space form a (...) Boolean algebra. We prove without choice principles that any Boolean algebra arises from a special spectral space X via the compact regular open sets of X; these sets may also be described as those that are both compact open in X and regular open in the upset topology of the specialization order of X, allowing one to apply to an arbitrary Boolean algebra simple reasoning about regular opens of a separative poset. Our representation is therefore a mix of Stone and Tarski, with the two connected by Vietoris: the relevant spectral spaces also arise as the hyperspace of nonempty closed sets of a Stone space endowed with the upper Vietoris topology. This connection makes clear the relation between our point-set topological approach to choice-free Stone duality, which may be called the hyperspace approach, and a point-free approach to choice-free Stone duality using Stone locales. Unlike Stone’s representation of Boolean algebras via Stone spaces, our choice-free topological representation of Boolean algebras does not show that every Boolean algebra can be represented as a field of sets; but like Stone’s representation, it provides the benefit of a topological perspective on Boolean algebras, only now without choice. In addition to representation, we establish a choice-free dual equivalence between the category of Boolean algebras with Boolean homomorphisms and a subcategory of the category of spectral spaces with spectral maps. We show how this duality can be used to prove some basic facts about Boolean algebras. (shrink)

In intuitionistic generalized predicative systems as constructive set theory, or constructive type theory, two categories have been proposed to play the role of the category of locales: the category FSp of formal spaces, and its full subcategory FSpi of inductively generated formal spaces. Considered in impredicative systems as the intuitionistic set theory IZF, FSp and FSpi are both equivalent to the category of locales. However, in the mentioned predicative systems, FSp fails to be closed under basic constructions such as that (...) of finite products, while FSpi is complete , but does not contain some naturally occurring classes of formal spaces. Moreover, completeness of FSpi only holds under the assumption of strong principles for the existence of inductively defined sets.In this paper, working in the context of constructive set theory, the category ImLoc of imaginary locales is introduced. ImLoc is complete already over weak formulations of constructive set theory, contains FSp and FSpi as full subcategories, and, as FSp and FSpi, is equivalent to the category of locales in IZF.Applications of the concept of imaginary locale to a proof of a point-free version of Tychonoff embedding theorem, and to set-representation theorems, are then presented. (shrink)

We revisit Kolchin's results on definability of differential Galois groups of strongly normal extensions, in the case where the field of constants is not necessarily algebraically closed. In certain classes of differential topological fields, which encompasses ordered or p‐valued differential fields, we find a partial Galois correspondence and we show one cannot expect more in general. In the class of ordered differential fields, using elimination of imaginaries in, we establish a relative Galois correspondence for relatively definable subgroups of the group (...) of differential order automorphisms. (shrink)

We develop a point-free construction of the classical one- dimensional continuum, with an interval structure based on mereology and either a weak set theory or logic of plural quantification. In some respects this realizes ideas going back to Aristotle,although, unlike Aristotle, we make free use of classical "actual infinity". Also, in contrast to intuitionistic, Bishop, and smooth infinitesimal analysis, we follow classical analysis in allowing partitioning of our "gunky line" into mutually exclusive and exhaustive disjoint parts, thereby (...) demonstrating the independence of "indecomposability" from a non-punctiform conception. It is surprising that such simple axioms as ours already imply the Archimedean property and that they determine an isomorphism with the Dedekind-Cantor structure of R as a complete, separable, ordered field. We also present some simple topological models of our system, establishing consistency relative to classical analysis. Finally, after describing how to nominalize our theory, we close with comparisons with earlier efforts related to our own. (shrink)

Let n be a positive integer and FAℓ be the free abelian lattice-ordered group on n generators. We prove that FAℓ and FAℓ do not satisfy the same first-order sentences in the language if m≠n. We also show that is decidable iff n{1,2}. Finally, we apply a similar analysis and get analogous results for the free finitely generated vector lattices.

This paper is a culmination of our new foundations for recursive analysis through recursive topology as reported in Kalantari and Welch 125; 98 87). While in those papers we developed groundwork for an approach to point free analysis and applied recursion theory, in this paper we blend techniques of recursion theory with those of topology to establish new findings. We present several new techniques different from existing ones which yield interesting results. Incidental to our work is (...) a unifying explanation of various schools of study for recursive analysis. (shrink)

We study finitely generated free Heyting algebras from a topological and from a model theoretic point of view. We review Bellissima’s representation of the finitely generated free Heyting algebra; we prove that it yields an embedding in the profinite completion, which is also the completion with respect to a naturally defined metric. We give an algebraic interpretation of the Kripke model used by Bellissima as the principal ideal spectrum and show it to be first order interpretable in (...) the Heyting algebra, from which several model theoretic and algebraic properties are derived. In particular, we prove that a free finitely generated Heyting algebra has only one set of free generators, which is definable in it. As a consequence its automorphism group is the permutation group over its generators. (shrink)

Zeilinger's observation that phenomena of the Aharonov-Bohm type lead to non-dispersive, i.e., energy-independent, phase shifts in interferometers is generalized in a new proof which shows that the precise condition for nondispersivity is a force-free interaction. The converse theorem is disproved by a conceptual counter-example. Applications to several nondispersive interference phenomena are reviewed briefly. Those fall into two classes which are objectively distinct from each other in that in the first class phase shifts depend only on the topology of (...) the interfering beam paths, while in the second class force-free physical interactions take place at identifiable points along the path. Apparent disagreements in the literature about the topological nature of the phenomena in the second class stem from differing definitions. (shrink)

In this paper we first give a variant of a theorem of Jockusch–Lewis– Remmel on existence of a computable, degree-preserving homeomorphism between a bounded strong ${\Pi^0_2}$ class and a bounded ${\Pi^0_1}$ class in 2 ω . Namely, we show that for mathematically common and interesting topological spaces, such as computably presented ${\mathbb{R}^n}$ , we can obtain a similar result where the homeomorphism is in fact the identity mapping. Second, we apply this finding to give a new, priority-free proof of (...) existence of a tree of shadow points computable in 0′. (shrink)

The starting point for the investigation in this paper is the following McKinsey-Tarski's Theorem: if f and g are algebraic functions (of the same number of variables) in a topological Boolean algebra (TBA) and if C(f)C(g) vanishes identically, then either f or g vanishes identically. The present paper generalizes this theorem to B-algebras and shows that validity of that theorem in a variety of B-algebras (B-variety) generated by SCI B -equations implies that its free Lindenbaum-Tarski's algebra is normal. (...) This is important in the semantical analysis of SCI B (the Boolean strengthening of the sentential calculus with identity, SCI) since normal B-algebras are just models of this logic. The rest part of the paper is concerned with relationships between some closure systems of filters, SCI B -theories, B-varieties and closed sets of SCI B -equations that have been derived both from the semantics of SCI B and from the semantics of the usual equational logic. (shrink)

Regions-based theories of space aim—among others—to define points in a geometrically appealing way. The most famous definition of this kind is probably due to Whitehead. However, to conclude that the objects defined are points indeed, one should show that they are points of a geometrical or a topological space constructed in a specific way. This paper intends to show how the development of mathematical tools allows showing that Whitehead’s method of extensive abstraction provides a construction of objects that are fundamental (...) building blocks of specific topological spaces. (shrink)

Whitehead, in two basic books, considers two different approaches to point-free geometry: the inclusion-based approach , whose primitive notions are regions and inclusion relation between regions, and the connection-based approach , where the connection relation is considered instead of the inclusion. We show that the latter cannot be reduced to the first one, although this can be done in the framework of multivalued logics.

A metric approach to Popper's verisimilitude question is proposed which is related to point-free geometry. Indeed, we define the theory of approximate metric spaces whose primitive notions are regions, inclusion relation, minimum distance, and maximum distance between regions. Then, we show that the class of possible scientific theories has the structure of an approximate metric space. So, we can define the verisimilitude of a theory as a function of its (approximate) distance from the truth. This avoids some of (...) the difficulties arising from the known definitions of verisimilitude. (shrink)

We face with the question of a suitable measure theory in Euclidean point-free geometry and we sketch out some possible solutions. The proposed measures, which are positive and invariant with respect to movements, are based on the notion of infinitesimal masses, i.e. masses whose associated supports form a sequence of finer and finer partitions.

This volume is dedicated to Leo Esakia's contributions to the theory of modal and intuitionistic systems. Consisting of 10 chapters, written by leading experts, this volume discusses Esakia’s original contributions and consequent developments that have helped to shape duality theory for modal and intuitionistic logics and to utilize it to obtain some major results in the area. Beginning with a chapter which explores Esakia duality for S4-algebras, the volume goes on to explore Esakia duality for Heyting algebras and its generalizations (...) to weak Heyting algebras and implicative semilattices. The book also dives into the Blok-Esakia theorem and provides an outline of the intuitionistic modal logic KM which is closely related to the Gödel-Löb provability logic GL. One chapter scrutinizes Esakia’s work interpreting modal diamond as the derivative of a topological space within the setting of point-free topology. The final chapter in the volume is dedicated to the derivational semantics of modal logic and other related issues. (shrink)

The general framework of this paper is a reformulation of Hilbert’s program using the theory of locales, also known as formal or point-free topology [P.T. Johnstone, Stone Spaces, in: Cambridge Studies in Advanced Mathematics, vol. 3, 1982; Th. Coquand, G. Sambin, J. Smith, S. Valentini, Inductively generated formal topologies, Ann. Pure Appl. Logic 124 71–106; G. Sambin, Intuitionistic formal spaces–a first communication, in: D. Skordev , Mathematical Logic and its Applications, Plenum, New York, 1987, pp. 187–204]. Formal (...) topology presents a topological space, not as a set of points, but as a logical theory which describes the lattice of open sets. The application to Hilbert’s program is then the following. Hilbert’s ideal objects are represented by points of such a formal space. There are general methods to “eliminate” the use of points, close to the notion of forcing and to the “elimination of choice sequences” in intuitionist mathematics, which correspond to Hilbert’s required elimination of ideal objects. This paper illustrates further this general program on the notion of valuations. They were introduced by Dedekind and Weber [R. Dedekind, H. Weber, Theorie des algebraischen Funktionen einer Veränderlichen, J. de Crelle t. XCII 181–290] to give a rigorous presentation of Riemann surfaces. It can be argued that it is one of the first example in mathematics of point-free representation of spaces [N. Bourbaki, Eléments de Mathématique. Algèbre commutative, Hermann, Paris, 1965, Chapitre 7]. It is thus of historical and conceptual interest to be able to represent this notion in formal topology. (shrink)

We classify two of Bertrand Russell's theories of events within the point-free ontology. The first of such approaches was presented informally by Russell in ‘The World of Physics and the World of Sense’ (Lecture IV in Our Knowledge of the External World of 1914). Based on this theory, Russell sketched ways to construct instants as collections of events. This paper formalizes Russell's approach from 1914. We will also show that in such a reconstructed theory, we obtain all axioms (...) of Russell's second theory from 1936 and all axioms of Thomason's theory of events from 1989. Russell's work certainly influenced the works of Stanisław Leśniewski, his student Alfred Tarski, and Czesław Lejewski – prominent members of the Lvov-Warsaw School (LWS). We see our work in the tradition of the research of Leśniewski and Tarski. Building on the technical tools developed in this environment and in the spirit of the traditional research of the LWS, we engage here, in particular, with two classic works by Russell on fundamental ontology. (shrink)

The paper presents the main idea of point-free theories of space based on Tarski's system of point-free geometry. First, the general idea of the so-called point-free ontology was discussed, as well as the epistemological and methodological reasons for its adoption. Next, Whitehead's method of extensive abstraction, which is the methodological basis for the construction of point-free theories of space, is presented, and the fundamental concepts of mereology are discussed. The main part of (...) the paper is a discussion of Tarski’s geometry of solids, its postulates and metatheoretical properties. The paper ends with a short description of the contribution of Polish researchers to the development of research on point-free theories of space. (shrink)

This paper presents several independence results concerning the topos-valid and the intuitionistic predicative theory of locales. In particular, certain consequences of the consistency of a general form of Troelstra's uniformity principle with constructive set theory and type theory are examined.

We introduce new algebraic and topological semantics for inquisitive logic. The algebraic semantics is based on special Heyting algebras, which we call inquisitive algebras, with propositional valuations ranging over only the ¬¬-fixpoints of the algebra. We show how inquisitive algebras arise from Boolean algebras: for a given Boolean algebra B, we define its inquisitive extension H(B) and prove that H(B) is the unique inquisitive algebra having B as its algebra of ¬¬-fixpoints. We also show that inquisitive algebras determine Medvedev’s logic (...) of finite problems. In addition to the algebraic characterization of H(B), we give a topological characterization of H(B) in terms of the recently introduced choice-free duality for Boolean algebras using so-called upper Vietoris spaces (UV-spaces). In particular, while a Boolean algebra B is realized as the Boolean algebra of compact regular open elements of a UV-space dual to B, we show that H(B) is realized as the algebra of compact open elements of this space. This connection yields a new topological semantics for inquisitive logic. (shrink)

In topological spaces, the relation of extended contact is a ternary relation that holds between regular closed subsets A, B and D if the intersection of A and B is included in D. The algebraic counterpart of this mereotopological relation is the notion of extended contact algebra which is a Boolean algebra extended with a ternary relation. In this paper, we are interested in the relational representation theory for extended contact algebras. In this respect, we study the correspondences between (...) class='Hi'>point-free and point-based models of space in terms of extended contact. More precisely, we prove new representation theorems for extended contact algebras. (shrink)

We study some connections between two kinds of emph{overlap} relations: that of point-free geometries in the sense of Grzegorczyk, Whitehead and Clarke, and that recently introduced by Sambin within his constructive approach to topology. The main thesis of this paper is that the overlap relation in the latter sense is a necessary tool for a constructive and intuitionistic development of point-free geometry.

This article reviews the interactions between Russell and the English mathematician Max Newman. The most substantial one occurred in 1928, when Newman published some penetrating criticisms of Russell’s philosophy of science, and followed up with two long letters to Russell on logical knowledge and on the potential use of topology in physics. The exchange, which opened up some issues in Russell’s philosophy that he did not fully cope with either at the time or later, is transcribed here. Their joint (...) involvements with the Royal Society of London are also recorded. (shrink)

Mereotopology is an extension of mereology with some relations of topological nature like contact. An algebraic counterpart of mereotopology is the notion of contact algebra which is a Boolean algebra whose elements are considered to denote spatial regions, extended with a binary relation of contact between regions. Although the language of contact algebra is quite expressive to define many useful mereological relations and mereotopological relations, there are, however, some interesting mereotopological relations which are not definable in it. Such are, for (...) instance, the relation of n-ary contact, internal connectedness and some others. To overcome this disadvantage, we introduce a generalisation of contact algebra, replacing the contact with a binary relation between finite sets of regions and a region, satisfying some formal properties of Tarski consequence relation. The obtained system is called sequent algebra, considered as an algebraic counterpart of a new mereotopology. We develop the topological representation theory for sequent algebras showing in this way certain correspondence between point-free and point-based models of space. As a by-product, we show how one logical relation in nature notion, Tarski consequence relation, may have also certain spatial meaning. (shrink)

In this paper we continue our work of Kalantari and Welch . There we introduced machinery to produce a point-free approach to points and functions on topological spaces and found conditions for both which lend themselves to effectivization. While we studied recursive points in that paper, here, we present two useful classes of recursive functions on topological spaces, apply them to the reals, and find precise accounting for the nature of the properties of some examples that exist in (...) the literature. We end with a construction of a recursive function on a small subset of the unit interval which is strongly nonextendible. (shrink)