Cantor’s proof that the reals are uncountable forms a central pillar in the edifices of higher order recursion theory and set theory. It also has important applications in model theory, and in the foundations of topology and analysis. Due partly to these factors, and to the simplicity and elegance of the proof, it has come to be accepted as part of the ABC’s of mathematics. But even if as an Archimedean point it supports tomes of mathematical theory, there (...) is a question that demands clarification: What, exactly, does Cantor’s proof show? One of few places where this question is addressed is Appendix II of Wittgenstein’s Remarks on the Foundations of Mathematics. This essay is devoted to clarifying Wittgenstein’s remarks in that section. (shrink)

We study the Medvedev degrees of mass problems with distinguished topological properties, such as denseness, closedness, or discreteness. We investigate the sublattices generated by these degrees; the prime ideal generated by the dense degrees and its complement, a prime filter; the filter generated by the nonzero closed degrees and the filter generated by the nonzero discrete degrees. We give a complete picture of the relationships of inclusion holding between these sublattices, these filters, and this ideal. We show that the sublattice (...) of the closed Medvedev degrees is not a Brouwer algebra. We investigate the dense degrees of mass problems that are closed under Turing equivalence, and we prove that the dense degrees form an automorphism base for the Medvedev lattice. The results hold for both the Medvedev lattice on the Baire space and the Medvedev lattice on the Cantor space. (shrink)

Dynamic Topological Logic ( $\mathcal{DTL}$ ) is a modal framework for reasoning about dynamical systems, that is, pairs 〈X, f〉 where X is a topological space and f: X → X a continuous function. In this paper we consider the case where X is a metric space. We first show that any formula which can be satisfied on an arbitrary dynamic topological system can be satisfied on one based on a metric space; in fact, this space can be taken to (...) be countable and have no isolated points. Since any metric space with these properties is homeomorphic to the set of rational numbers, it follows that any satisfiable formula can be satisfied on a system based on $\mathbb{Q}$ . We then show that the situation changes when considering complete metric spaces, by exhibiting a formula which is not valid in general but is valid on the class of systems based on a complete metric space. While we do not attempt to give a full characterization of the set of valid formulas on this class we do give a relative completeness result; any formula which is satisfiable on a dynamical system based on a complete metric space is also satisfied on one based on the Cantor space. (shrink)

We prove a generalization of the hyper-game theorem by using an abstract version of inductively generated formal topology. As applications we show proofs for Cantor theorem, uncountability of the set of functions from N to N and Gödel theorem which use no diagonal argument.

This paper is concerned with topological set theory, and particularly with Skala's and Manakos' systems for which we give a topological characterization of the models. This enables us to answer natural questions about those theories, reviewing previous results and proving new ones. One of these shows that Skala's set theory is in a sense compatible with any ‘normal’ set theory, and another appears on the semantic side as a ‘Cantor theorem’ for the category of Alexandroff spaces.

We introduce reflection properties of cardinals in which the attributes that reflect are expressible by infinitary formulas whose lengths can be strictly larger than the cardinal under consideration. This kind of generalized reflection principle leads to the definitions of [Formula: see text]-indescribability and [Formula: see text]-indescribability of a cardinal [Formula: see text] for all [Formula: see text]. In this context, universal [Formula: see text] formulas exist, there is a normal ideal associated to [Formula: see text]-indescribability and the notions of [Formula: (...) see text]-indescribability yield a strict hierarchy below a subtle cardinal. Additionally, given a regular cardinal [Formula: see text], we introduce a diagonal version of Cantor’s derivative operator and use it to extend Bagaria’s [Derived topologies on ordinals and stationary reflection, Trans. Amer. Math. Soc. 371(3) (2019) 1981–2002] sequence [Formula: see text] of derived topologies on [Formula: see text] to [Formula: see text]. Finally, we prove that for all [Formula: see text], if there is a stationary set of [Formula: see text] that have a high enough degree of indescribability, then there are stationarily many [Formula: see text] that are nonisolated points in the space [Formula: see text]. (shrink)

Recent arguments asserting a topological turn in culture also identify a range of topologically informed interventions in social and cultural theory. Talk of a topological turn evokes both the enduring interest that the field of mathematics presents and the business of analysis in the cultural sphere. This article questions the novelty of this ‘becoming topological of culture’ and digs into a deeper historicity in order to identify the trends that may be said to support the development of topology in (...) the current situation. It also examines the relationship between mathematics considered ontologically and mathematics considered epistemologically, in order to better grasp the significance of the practical abstractions that mathematics as technics manifests. Discussions of Cantor, Russell, Poincaré, Lévi-Strauss, Lacan and others address the background of contemporary mathematical topology. The article goes on to examine Alain Badiou’s principle that mathematics is ontology and concludes with a discussion of the mathematics of Martin Heidegger. (shrink)

Cantor’s proof that the reals is uncountable forms a central pillar in the edifices of higher order recursion theory and set theory. It also has important applications in model theory, and in the foundations of topology and analysis. Due partly to these factors, and to the simplicity and elegance of the proof, it has come to be accepted as part of the ABC’s of mathematics. But even if it supports tomes of mathematical theory, there is a question that (...) demands clarification: What does Cantor’s proof show? One of few places where this question is addressed is Appendix II of Wittgenstein’s Remarks on the Foundations of Mathematics. This essay is devoted to clarifying Wittgenstein’s key interpretive remarks. (shrink)

A possible world is a junky world if and only if each thing in it is a proper part. The possibility of junky worlds contradicts the principle of general fusion. Bohn (2009) argues for the possibility of junky worlds, Watson (2010) suggests that Bohn‘s arguments are flawed. This paper shows that the arguments of both authors leave much to be desired. First, relying on the classical results of Cantor, Zermelo, Fraenkel, and von Neumann, this paper proves the possibility of (...) junky worlds for certain weak set theories. Second, the paradox of Burali-Forti shows that according to the Zermelo-Fraenkel set theory ZF, junky worlds are possible. Finally, it is shown that set theories are not the only sources for designing plausible models of junky worlds: Topology (and possibly other "algebraic" mathematical theories) may be used to construct models of junky worlds. In sum, junkyness is a relatively widespread feature among possible worlds. (shrink)

It is a celebrated result of McKinsey and Tarski [28] thatS4is the logic of the closure algebraΧ+over any dense-in-itself separable metrizable space. In particular,S4is the logic of the closure algebra over the realsR, the rationalsQ, or the Cantor spaceC. By [5], each logic aboveS4that has the finite model property is the logic of a subalgebra ofQ+, as well as the logic of a subalgebra ofC+. This is no longer true forR, and the main result of [5] states that each (...) connected logic aboveS4with the finite model property is the logic of a subalgebra of the closure algebraR+.In this paper we extend these results to all logics aboveS4. Namely, for a normal modal logicL, we prove that the following conditions are equivalent: (i)Lis aboveS4, (ii)Lis the logic of a subalgebra ofQ+, (iii)Lis the logic of a subalgebra ofC+. We introduce the concept of a well-connected logic aboveS4and prove that the following conditions are equivalent: (i)Lis a well-connected logic, (ii)Lis the logic of a subalgebra of the closure algebra$\xi _2^ + $over the infinite binary tree, (iii)Lis the logic of a subalgebra of the closure algebra${\bf{L}}_2^ + $over the infinite binary tree with limits equipped with the Scott topology. Finally, we prove that a logicLaboveS4is connected iffLis the logic of a subalgebra ofR+, and transfer our results to the setting of intermediate logics.Proving these general completeness results requires new tools. We introduce the countable general frame property (CGFP) and prove that each normal modal logic has the CGFP. We introduce general topological semantics forS4, which generalizes topological semantics the same way general frame semantics generalizes Kripke semantics. We prove that the categories of descriptive frames forS4and descriptive spaces are isomorphic. It follows that every logic aboveS4is complete with respect to the corresponding class of descriptive spaces. We provide several ways of realizing the infinite binary tree with limits, and prove that when equipped with the Scott topology, it is an interior image of bothCandR. Finally, we introduce gluing of general spaces and prove that the space obtained by appropriate gluing involving certain quotients ofL2is an interior image ofR. (shrink)

We obtain some new results on the topology of unary definable sets in expansions of densely ordered Abelian groups of burden 2. In the special case in which the structure has dp‐rank 2, we show that the existence of an infinite definable discrete set precludes the definability of a set which is dense and codense in an interval, or of a set which is topologically like the Cantor middle‐third set (Theorem 2.9). If it has burden 2 and both (...) an infinite discrete set D and a dense‐codense set X are definable, then translates of X must witness the Independence Property (Theorem 2.26). In the last section, an explicit example of an ordered Abelian group of burden 2 is given in which both an infinite discrete set and a dense‐codense set are definable. (shrink)

It is well known that infinite minimal sets for continuous functions on the interval are Cantor sets; that is, compact zero dimensional metrizable sets without isolated points. On the other hand, it was proved in Alcaraz and Sanchis (Bifurcat Chaos 13:1665–1671, 2003) that infinite minimal sets for continuous functions on connected linearly ordered spaces enjoy the same properties as Cantor sets except that they can fail to be metrizable. However, no examples of such subsets have been known. In (...) this note we construct, in ZFC, ${2^{\mathfrak{c}}}$ non-metrizable infinite pairwise non-homeomorphic minimal sets on compact connected linearly ordered spaces. (shrink)

If one builds a topological model, analogous to that of Moschovakis , over the product of uncountably many copies of the Cantor set, one obtains a structure elementarily equivalent to Krol's model . In an intuitionistic metatheory Moschovakis's original model satisfies all the axioms of intuitionistic analysis, including the unrestricted version of weak continuity for numbers.

The completeness of the modal logic S4 for all topological spaces as well as for the real line , the n-dimensional Euclidean space and the segment etc. was proved by McKinsey and Tarski in 1944. Several simplified proofs contain gaps. A new proof presented here combines the ideas published later by G. Mints and M. Aiello, J. van Benthem, G. Bezhanishvili with a further simplification. The proof strategy is to embed a finite rooted Kripke structure for S4 into a subspace (...) of the Cantor space which in turn encodes . This provides an open and continuous map from onto the topological space corresponding to . The completeness follows as S4 is complete with respect to the class of all finite rooted Kripke structures. (shrink)

We examine topological dynamical systems on the Cantor set from the point of view of the continuous model theory of commutative C*-algebras. After some general remarks, we focus our attention on the generic homeomorphism of the Cantor set, as constructed by Akin, Glasner, and Weiss. We show that this homeomorphism is the prime model of its theory. We also show that the notion of “generic” used by Akin, Glasner, and Weiss is distinct from the notion of “generic” encountered (...) in Fraïssé theory. (shrink)

In topological modal logic, it is well known that the Cantor derivative is more expressive than the topological closure, and the ‘elsewhere’, or ‘difference’, operator is more expressive than the ‘somewhere’ operator. In 2014, Kudinov and Shehtman asked whether the combination of closure and elsewhere becomes strictly more expressive when adding the Cantor derivative. In this paper we give an affirmative answer: in fact, the Cantor derivative alone can define properties of topological spaces not expressible with closure (...) and elsewhere. To prove this, we develop a novel theory of morphisms which preserve formulas with the elsewhere operator. (shrink)

The concept of a Mannigfaltigkeit in Husserl has been given various interpretations, due to its shifting role in his works. Many authors have been misled by this term, placing it in the context of Husserl’s early period in Halle, while writing the Philosophy of Arithmetic, as a friend and colleague of Georg Cantor.Yet at the time, Husserl distanced himself explicitly from Cantor’s definition and rather took Bernhard Riemann as example, having studied and lectured extensively on Riemann’s theories of (...) space. Husserl’s Mannigfaltigkeitslehre would then not be a Cantorian set-theory, but come rather closer to topology. Then, in the Prolegomena, Husserl introduces the idea of a pure Mannigfaltigkeitslehre as a meta-theoretical enterprise which studies the relations among theories, e.g. how to derive or found one upon another. When Husserl announces that in fact the best example of such a pure theory of manifolds is what is actually practiced in mathematics, this sounds slightly misleading. The pure theory of theories cannot simply be the mathematics underlying topology, but should rather be considered as a mathesis universalis. Indeed, while this might not have been fully clear yet in 1900/1901, Husserl will explicitly tie together the notions of pure theory of manifolds and mathesis universalis. The mathesis universalis in this sense is formal, a priori and analytic, as theory of theory in general. It is an analysis of the highest categories of meaning and their correlative categories of objects. In my paper I try to understand the development of the notion of Mannigfaltigkeit in Husserl’s thought from its mathematical beginnings to its later central philosophical role, taking into account the mathematical background and context of Husserl’s own development. (shrink)

The concept of a Mannigfaltigkeit in Husserl has been given various interpretations, due to its shifting role in his works. Many authors have been misled by this term, placing it in the context of Husserl’s early period in Halle, while writing the Philosophy of Arithmetic, as a friend and colleague of Georg Cantor.Yet at the time, Husserl distanced himself explicitly from Cantor’s definition and rather took Bernhard Riemann as example, having studied and lectured extensively on Riemann’s theories of (...) space. Husserl’s Mannigfaltigkeitslehre would then not be a Cantorian set-theory, but come rather closer to topology. Then, in the Prolegomena, Husserl introduces the idea of a pure Mannigfaltigkeitslehre as a meta-theoretical enterprise which studies the relations among theories, e.g. how to derive or found one upon another. When Husserl announces that in fact the best example of such a pure theory of manifolds is what is actually practiced in mathematics, this sounds slightly misleading. The pure theory of theories cannot simply be the mathematics underlying topology, but should rather be considered as a mathesis universalis. Indeed, while this might not have been fully clear yet in 1900/1901, Husserl will explicitly tie together the notions of pure theory of manifolds and mathesis universalis. The mathesis universalis in this sense is formal, a priori and analytic, as theory of theory in general. It is an analysis of the highest categories of meaning and their correlative categories of objects. In my paper I try to understand the development of the notion of Mannigfaltigkeit in Husserl’s thought from its mathematical beginnings to its later central philosophical role, taking into account the mathematical background and context of Husserl’s own development. (shrink)

In the pioneering article and two papers, written jointly with McKinsey, Tarski developed the so-called algebraic and topological frameworks for the Intuitionistic Logic and the Lewis modal system. In this paper, we present an outline of modern systems with a topological tinge. We consider topological interpretation of basic systems GL and G of the provability logic in terms of the Cantor derivative and the Hausdorff residue.

Let $\mathcal{L}$ be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality $\square$ and a temporal modality $\bigcirc$ , understood as ‘next’. We extend the topological semantic for S4 to a semantics for the language $\mathcal{L}$ by interpreting $\mathcal{L}$ in dynamic topological systems, i.e. ordered pairs $\langle X, f\rangle$ , where X is a topological space and f is a continuous function on X. Artemov, Davoren and Nerode have axiomatized a logic S4C, and have shown (...) that S4C is sound and complete for this semantics. Zhang and Mints have shown that S4C is complete relative to a particular topological space, Cantor space. The current paper produces an alternate proof of the Zhang-Mints result. (shrink)

A dictionary is a set of finite words over some finite alphabet X. The omega-power of a dictionary V is the set of infinite words obtained by infinite concatenation of words in V. Lecomte studied in [Omega-powers and descriptive set theory, JSL 2005] the complexity of the set of dictionaries whose associated omega-powers have a given complexity. In particular, he considered the sets $W({bfSi}^0_{k})$ (respectively, $W({bfPi}^0_{k})$, $W({bfDelta}_1^1)$) of dictionaries $V subseteq 2^star$ whose omega-powers are ${bfSi}^0_{k}$-sets (respectively, ${bfPi}^0_{k}$-sets, Borel sets). In (...) this paper we first establish a new relation between the sets $W({bfSigma}^0_{2})$ and $W({bfDelta}_1^1)$, showing that the set $W({bfDelta}_1^1)$ is ``more complex' than the set $W({bfSigma}^0_{2})$. As an application we improve the lower bound on the complexity of $W({bfDelta}_1^1)$ given by Lecomte. Then we prove that, for every integer $kgeq 2$, (respectively, $kgeq 3$) the set of dictionaries $W({bfPi}^0_{k+1})$ (respectively, $W({bfSi}^0_{k+1})$) is ``more complex' than the set of dictionaries $W({bfPi}^0_{k})$ (respectively, $W({bfSi}^0_{k})$). (shrink)

We develop the general theory of topometric spaces, i.e., topological spaces equipped with a well-behaved lower semi-continuous metric. Spaces of global and local types in continuous logic are the motivating examples for the study of such spaces. In particular, we develop Cantor-Bendixson analysis of topometric spaces, which can serve as a basis for the study of local stability (extending the ad hoc development in Ben Yaacov I and Usvyatsov A, Continuous first order logic and local stability. Trans Am Math (...) Soc, in press), as well as of global ${\aleph_0}$ -stability. We conclude with a study of perturbation systems (see Ben Yaacov I, On perturbations of continuous structures, submitted) in the formalism of topometric spaces. In particular, we show how the abstract development applies to ${\aleph_0}$ -stability up to perturbation. (shrink)

This paper is on Aristotle's conception of the continuum. It is argued that although Aristotle did not have the modern conception of real numbers, his account of the continuum does mirror the topology of the real number continuum in modern mathematics especially as seen in the work of Georg Cantor. Some differences are noted, particularly as regards Aristotle's conception of number and the modern conception of real numbers. The issue of whether Aristotle had the notion of open versus (...) closed intervals is discussed. Finally, it is suggested that one reason there is a common structure between Aristotle's account of the continuum and that found in Cantor's definition of the real number continuum is that our intuitions about the continuum have their source in the experience of the real spatiotemporal world. A plea is made to consider Aristotle's abstractionist philosophy of mathematics anew. (shrink)

We consider finite partitions of the closure F¯ of an ωα-uniform barrier F. For each partition, we get a homogeneous set having both the same combinatorial and topological structure as F¯, seen as a subspace of the Cantor space 2N.

INSPIRED by a dynamist Naturphilosophie and looking for a mathematics of the natura naturans, the founders of modern mathematics in Germany made some lasting contributions in the attempt to go beyond perceptible space. Hermann Grassmann’s extension theory, Johann Benedict Listing’s topology, Bernhard Riemann’s non-Euclidean manifold theory, Carl Gustav Jacob Jacobi’s approach to non-mechanistic theory and last but not least Georg Cantor’s transfinite set theory were all influenced by the tradition of Naturphilosophie. One central motivation for the new mathematics (...) was to decipher the so-called “inner side of nature” which was thought to be invisible but nonetheless physical. As a result, mathematics was understood not only in terms of quantity but of morphogenetic quality and as a tool to recognize the intrinsic possibilities of structuring and organizing nature. This essay focuses on the philosophical viewpoints of Christian Samuel Weiss, Justus and Hermann Grassmann, Bernhard Riemann and their reception of Schelling’s philosophy. Riemann deconstructed empiricist theories of space so as to glean the fundamental constitution of space. One result was that a given, fixed and static metric is not necessary for the understanding of space. The underlying topological substratum has no specific metric but is capable of exhibiting any possible metric. Riemann’s claims are compared with Schelling’s theory of space in his “Darstellung des Naturprocesses”. My thesis is that Schelling’s philosophy of the emergence of space can be read in Riemannian terms and that it is an interesting model in the context of modern questions. (shrink)

Let ${{\mathcal L}^{\square\circ}}$ be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality □ and a temporal modality ◦, understood as ‘next’. We extend the topological semantic for S4 to a semantics for the language ${{\mathcal L}^{\square\circ}}$ by interpreting ${{\mathcal L}^{\square\circ}}$ in dynamic topological systems, i.e., ordered pairs 〈X, f〉, where X is a topological space and f is a continuous function on X. Artemov, Davoren and Nerode have axiomatized a logic S4C, and have shown (...) that S4C is sound and complete for this semantics. S4C is also complete for continuous functions on Cantor space (Mints and Zhang, Kremer), and on the real plane (Fernández Duque); but incomplete for continuous functions on the real line (Kremer and Mints, Slavnov). Here we show that S4C is complete for continuous functions on the rational numbers. (shrink)

We study hybrid logics in topological semantics. We prove that hybrid logics of separation axioms are complete with respect to certain classes of finite topological models. This characterisation allows us to obtain several further results. We prove that aforementioned logics are decidable and PSPACE-complete, the logics of T 1 and T 2 coincide, the logic of T 1 is complete with respect to two concrete structures: the Cantor space and the rational numbers.

In the topological semantics for modal logic, S4 is well-known to be complete for the rational line, for the real line, and for Cantor space: these are special cases of S4’s completeness for any dense-in-itself metric space. The construction used to prove completeness can be slightly amended to show that S4 is not only complete, but also strongly complete, for the rational line. But no similarly easy amendment is available for the real line or for Cantor space and (...) the question of strong completeness for these spaces has remained open, together with the more general question of strong completeness for any dense-in-itself metric space. In this paper, we prove that S4 is strongly complete for any dense-in-itself metric space. (shrink)

We establish some results on the Borel and difference hierarchies in φ-spaces. Such spaces are the topological counterpart of the algebraic directed-complete partial orderings. E.g., we prove analogs of the Hausdorff Theorem relating the difference and Borel hierarchies and of the Lavrentyev Theorem on the non-collapse of the difference hierarchy. Some of our results generalize results of A. Tang for the space Pω. We also sketch some older applications of these hierarchies and present a new application to the question of (...) characterizing the ω-ary Boolean operations generating a given level of the Wadge hierarchy from the open sets. (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)

We study the structure of analytic ideals of subsets of the natural numbers. For example, we prove that for an analytic ideal I, either the ideal {X (Ω × Ω: En X ({0, 1,…,n} × Ω } is Rudin-Keisler below I, or I is very simply induced by a lower semicontinuous submeasure. Also, we show that the class of ideals induced in this manner by lsc submeasures coincides with Polishable ideals as well as analytic P-ideals. We study this class of (...) ideals and characterize, for example, when the ideals in it are Fσ or when they carry a locally compact group topology. We apply these results to Borel partial orders to rederive a theorem of Todorcevic and to Borel equivalence relations to answer a question of Kechris and Louveau. As another application we give a characterization of σ-ideals of μ-zero sets for Maharam submeasures μ on the Cantor set which is to a large extent analogous to a characterization of the meager ideal due to Kechris and the author. (shrink)

We prove strong completeness results for some modal logics with the universal modality, with respect to their topological semantics over 0-dimensional dense-in-themselves metric spaces. We also use failure of compactness to show that, for some languages and spaces, no standard modal deductive system is strongly complete.

This paper studies, by way of an example, the intuitionistic propositional connective * defined in the language of second order propositional logic by * ≡ ∃Q. In full topological models * is not generally definable but over Cantor-space and the reals it can be classically shown that *↔ ⅂⅂P; on the other hand, this is false constructively, i.e. a contradiction with Church's thesis is obtained. This is comparable with some well-known results on the completeness of intuitionistic first-order predicate logic. (...) Over [0, 1], the operator * is undefinable. We show how to recast this argument in terms of intuitive intuitionistic validity in some parameter. The undefinability argument essentially uses the connectedness of [0, 1]; most of the work of recasting consists in the choice of a suitable intuitionistically meaningful parameter, so as to imitate the effect of connectedness. Parameters of the required kind can be obtained as so-called projections of lawless sequences. (shrink)

Could space consist entirely of extended regions, without any regions shaped like points, lines, or surfaces? Peter Forrest and Frank Arntzenius have independently raised a paradox of size for space like this, drawing on a construction of Cantor’s. I present a new version of this argument and explore possible lines of response.

Examples of possible theological influences upon the development of mathematics are indicated. The best known connection can be found in the realm of infinite sets treated by us as known or graspable, which constitutes a divine-like approach. Also the move to treat infinite processes as if they were one finished object that can be identified with its limits is routine in mathematicians, but refers to seemingly super-human power. For centuries this was seen as wrong and even today some philosophers, for (...) example Brian Rotman, talk critically about “theological mathematics”. Theological metaphors, like “God’s view”, are used even by contemporary mathematicians. While rarely appearing in official texts they are rather easily invoked in “the kitchen of mathematics”. There exist theories developing without the assumption of actual infinity the tools of classical mathematics needed for applications (For instance, Mycielski’s approach). Conclusion: mathematics could have developed in another way. Finally, several specific examples of historical situations are mentioned where, according to some authors, direct theological input into mathematics appeared: the possibility of the ritual genesis of arithmetic and geometry, the importance of the Indian religious background for the emergence of zero, the genesis of the theories of Cantor and Brouwer, the role of Name-worshipping for the research of the Moscow school of topology. Neither these examples nor the previous illustrations of theological metaphors provide a certain proof that religion or theology was directly influencing the development of mathematical ideas. They do suggest, however, common points and connections that merit further exploration. (shrink)

A constructive definition of the continuum based on formal topology is given and its basic properties studied. A natural notion of Cauchy sequence is introduced and Cauchy completeness is proved. Other results include elementary proofs of the Baire and Cantor theorems. From a classical standpoint, formal reals are seen to be equivalent to the usual reals. Lastly, the relation of real numbers as a formal space to other approaches to constructive real numbers is determined.

We propose an extension of Aczel's constructive set theory CZF by an axiom for inductive types and a choice principle, and show that this extension has the following properties: it is interpretable in Martin-Löf's type theory. In addition, it is strong enough to prove the Set Compactness theorem and the results in formal topology which make use of this theorem. Moreover, it is stable under the standard constructions from algebraic set theory, namely exact completion, realizability models, forcing as well (...) as more general sheaf extensions. As a result, methods from our earlier work can be applied to show that this extension satisfies various derived rules, such as a derived compactness rule for Cantor space and a derived continuity rule for Baire space. Finally, we show that this extension is robust in the sense that it is also reflected by the model constructions from algebraic set theory just mentioned. (shrink)

This paper studies, by way of an example, the intuitionistic propositional connective * defined in the language of second order propositional logic by. In full topological models * is not generally definable, but over Cantor-space and the reals it can be classically shown that; on the other hand, this is false constructively, i.e. a contradiction with Church's thesis is obtained. This is comparable with some well-known results on the completeness of intuitionistic first-order predicate logic.Over [0, 1], the operator * (...) is (constructively and classically) undefinable. We show how to recast this argument in terms of intuitive intuitionistic validity in some parameter. The undefinability argument essentially uses the connectedness of [0, 1]; most of the work of recasting consists in the choice of a suitable intuitionistically meaningful parameter, so as to imitate the effect of connectedness. (shrink)

We investigate some common points between stable structures and weakly small structures and define a structureMto befineif the Cantor-Bendixson rank of the topological space${S_\varphi }\left} \right)$is an ordinal for every finite subsetAofMand every formula$\varphi \left$wherexis of arity 1. By definition, a theory isfineif all its models are so. Stable theories and small theories are fine, and weakly minimal structures are fine. For any finite subsetAof a fine groupG, the traces on the algebraic closure$acl\left$ofAof definable subgroups ofGover$acl\left$which are boolean combinations (...) of instances of an arbitrary fixed formula can decrease only finitely many times. An infinite field with a fine theory has no additive nor multiplicative proper definable subgroups of finite index, nor Artin-Schreier extensions. (shrink)

In this paper we show that some standard topological constructions may be fruitfully used in the theory of closure spaces (see [5], [4]). These possibilities are exemplified by the classical theorem on the universality of the Alexandroff's cube for T 0-closure spaces. It turns out that the closure space of all filters in the lattice of all subsets forms a generalized Alexandroff's cube that is universal for T 0-closure spaces. By this theorem we obtain the following characterization of the consequence (...) operator of the classical logic: If is a countable set and C: P() P() is a closure operator on X, then C satisfies the compactness theorem iff the closure space ,C is homeomorphically embeddable in the closure space of the consequence operator of the classical logic.We also prove that for every closure space X with a countable base such that the cardinality of X is not greater than 2 there exists a subset X of irrationals and a subset X of the Cantor's set such that X is both a continuous image of X and a continuous image of X. (shrink)

We investigate computability theoretic and topological properties of spaces of orders on computable orderable groups. A left order on a group G is a linear order of the domain of G, which is left-invariant under the group operation. Right orders and bi-orders are defined similarly. In particular, we study groups for which the spaces of left orders are homeomorphic to the Cantor set, and their Turing degree spectra contain certain upper cones of degrees. Our approach unifies and extends Sikora’s (...) [28] investigation of orders on groups in topology and Solomon’s [31] investigation of these orders in computable algebra. Furthermore, we establish that a computable free group Fn of rank n>1 has a bi-order in every Turing degree. (shrink)

Examples of possible theological influences upon the development of mathematics are indicated. The best known connection can be found in the realm of infinite sets treated by us as known or graspable, which constitutes a divine-like approach. Also the move to treat infinite processes as if they were one finished object that can be identified with its limits is routine in mathematicians, but refers to seemingly super-human power. For centuries this was seen as wrong and even today some philosophers, for (...) example Brian Rotman, talk critically about “theological mathematics”. Theological metaphors, like “God’s view”, are used even by contemporary mathematicians. While rarely appearing in official texts they are rather easily invoked in “the kitchen of mathematics”. There exist theories developing without the assumption of actual infinity the tools of classical mathematics needed for applications. Conclusion: mathematics could have developed in another way. Finally, several specific examples of historical situations are mentioned where, according to some authors, direct theological input into mathematics appeared: the possibility of the ritual genesis of arithmetic and geometry, the importance of the Indian religious background for the emergence of zero, the genesis of the theories of Cantor and Brouwer, the role of Name-worshipping for the research of the Moscow school of topology. Neither these examples nor the previous illustrations of theological metaphors provide a certain proof that religion or theology was directly influencing the development of mathematical ideas. They do suggest, however, common points and connections that merit further exploration. (shrink)

We study the measure semantics for propositional modal logics, in which formulas are interpreted in theLebesgue measure algebra${\cal M}$, or algebra of Borel subsets of the real interval [0,1] modulo sets of measure zero. It was shown in Lando (2012) and Fernández-Duque (2010) that the propositional modal logicS4 is complete for the Lebesgue measure algebra. The main result of the present paper is that every logicL aboveS4 is complete for some subalgebra of${\cal M}$. Indeed, there is a single model over (...) a subalgebra of${\cal M}$in which all nontheorems ofLare refuted. This work builds on recent work by Bezhanishvili, Gabelaia, & Lucero-Bryan (2015) on the topological semantics for logics aboveS4. In Bezhanishviliet al., (2015), it is shown that there are logics above that arenotthe logic of any subalgebra of the interior algebra over the real line,${\cal B}$(ℝ), but that every logic above is the logic of some subalgebra of the interior algebra over the rationals,${\cal B}$(ℚ), and the interior algebra over Cantor space,${\cal B}\left( {\cal C} \right)$. (shrink)

We give an analysis over a variation of causal sets where the light cone of an event is represented by finitely branching trees with respect to any given arbitrary dynamics. We argue through basic topological properties of Cantor space that under certain assumptions about the universe, spacetime structure and causation, given any event x, the number of all possible future worldlines of x within the many-worlds interpretation is uncountable. However, if all worldlines extending the event x are ‘eventually deterministic’, (...) then the cardinality of the set of future worldlines with respect to x is exactly ℵ0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\aleph _0$$\end{document}, i.e., countably infinite. We also observe that if there are countably many future worldlines with respect to x, then at least one of them must be necessarily ‘decidable’ in the sense that there is an algorithm which determines whether or not any given event belongs to that worldline. We then show that if there are only finitely many worldlines in the future of an event x, then they are all decidable. We finally point out the fact that there can be only countably many terminating worldlines. (shrink)

One of the earliest applications of transfinite numbers is in the construction of derived sequences by Cantor [2]. In [6], the existence of derived sequences for countable closed sets is proved in ATR0. This existence theorem is an intermediate step in a proof that a statement concerning topological comparability is equivalent to ATR0. In actuality, the full strength of ATR0 is used in proving the existence theorem. To show this, we will derive a statement known to be equivalent to (...) ATR0, using only RCA0 and the assertion that every countable closed set has a derived sequence. We will use three of the subsystems of second order arithmetic defined by H. Friedman , which can be roughly characterized by the strength of their set comprehension axioms. RCA0 includes comprehension for Δmath image definable sets, ACA0 includes comprehension for arithmetical sets, and ATR0 appends to ACA0 a comprehension scheme for sets defined by transfinite recursion on arithmetical formulas. MSC: 03F35, 54B99. (shrink)

How the concept of proof has enabled the creation of mathematical knowledge. The Story of Proof investigates the evolution of the concept of proof--one of the most significant and defining features of mathematical thought--through critical episodes in its history. From the Pythagorean theorem to modern times, and across all major mathematical disciplines, John Stillwell demonstrates that proof is a mathematically vital concept, inspiring innovation and playing a critical role in generating knowledge. Stillwell begins with Euclid and his influence on the (...) development of geometry and its methods of proof, followed by algebra, which began as a self-contained discipline but later came to rival geometry in its mathematical impact. In particular, the infinite processes of calculus were at first viewed as "infinitesimal algebra," and calculus became an arena for algebraic, computational proofs rather than axiomatic proofs in the style of Euclid. Stillwell proceeds to the areas of number theory, non-Euclidean geometry, topology, and logic, and peers into the deep chasm between natural number arithmetic and the real numbers. In its depths, Cantor, Gödel, Turing, and others found that the concept of proof is ultimately part of arithmetic. This startling fact imposes fundamental limits on what theorems can be proved and what problems can be solved. Shedding light on the workings of mathematics at its most fundamental levels, The Story of Proof offers a compelling new perspective on the field's power and progress. (shrink)

This is easily the most systematic survey of the foundations of logic and mathematics available today. Although Beth does not cover the development of set theory in great detail, all other aspects of logic are well represented. There are nine chapters which cover, though not in this order, the following: historical background and introduction to the philosophy of mathematics; the existence of mathematical objects as expressed by Logicism, Cantorism, Intuitionism, and Nominalism; informal elementary axiomatics; formalized axiomatics with reference to finitary (...) theory of proof; non-elementary metamathematics, embracing formal syntax and semantics; applications of set theory and topology in metamathematics—especially in the theory of models; recursive function theory; the logical paradoxes; the relation of philosophy of mathematics to general philosophy. This is a mere skeleton of the whole, but it indicates the broad sweep of the work. One unifying feature is the author's use of his "semantic tableau" method of examining the truth or falsity of sentences. Although the author is an Intuitionist, classical metamathematical proof techniques are by no means slighted; they are used throughout much of the book, and are indispensable, of course, when dealing with classical logic. Exercises are scattered throughout and at the end; few of them are trivial. There is a very extensive bibliography, brought up to date from the first edition. This extraordinary book will be of use to logicians as a reference tool and to philosophers trying to survey the field of modern formal logic; its appearance in a fine paper edition is therefore doubly welcome—P. J. M. (shrink)

The thesis focuses on a quite recent research field lying in between Descriptive Set Theory and Automata Theory (for infinite objects). In both areas, one is often concerned with subsets of the Cantor space or of its homeomorphic copies. In Descriptive Set Theory, such subsets are usually stratified in topological hierarchies, like the Borel hierarchy, the Wadge hierarchy and the difference hierarchy; in Automata Theory, such sets are studied in terms of regularity, that is, the property of being recognised (...) by an automaton or, equivalently, of being expressible in Monadic Second-Order Logic. This double point of view leads to many interesting questions about the interplay and relationship between topological complexity and regularity. While we have a complete picture of what happens in the case of automata on words, the case of automata on trees is still a terra incognita. Some results have already been obtained for particular classes of languages, like Buchi languages, deterministic languages, ¨ and unambiguous languages. In this thesis we instead drop any restriction and prove some new results concerning arbitrary regular tree languages which belong to low levels of the Borel hierarchy and of the Wadge hierarchy. (shrink)

Science and Christianity Content Type Journal Article Category Book Review Pages 1-4 DOI 10.1007/s11016-011-9544-2 Authors Geoffrey Cantor, Science and Technology Studies, University College London, Gower Street, London, WC1E 6BT UK Journal Metascience Online ISSN 1467-9981 Print ISSN 0815-0796.