By creating an unbounded topological reduction theory for complex Hilbert spaces over Stonean spaces, we can give a category-theoretic duality between Boolean valued analysis and topological reduction theory for complex Hilbert spaces. MSC: 03C90, 03E40, 06E15, 46M99.

Knowledge reduction of information systems is one of the most important parts of rough set theory in real-world applications. Based on the connections between the rough set theory and the theory of topology, a kind of topological reduction of incomplete information systems is discussed. In this study, the topological reduction of incomplete information systems is characterized by belief and plausibility functions from evidence theory. First, we present that a topological space (...) induced by a pair of approximation operators in an incomplete information system is pseudo-discrete, which deduces a partition. Then, the topological reduction is characterized by the belief and plausibility function values of the sets in the partition. A topological reduction algorithm for computing the topological reducts in incomplete information systems is also proposed based on evidence theory, and its efficiency is examined by an example. Moreover, relationships among the concepts of topological reduct, classical reduct, belief reduct, and plausibility reduct of an incomplete information system are presented. (shrink)

Let T be a simple L-theory and let \ be a reduct of T to a sublanguage \ of L. For variables x, we call an \-invariant set \\) in \ a universal transducer if for every formula \\in L^-\) and every a, $$\begin{aligned} \phi ^-\ L^-\text{-forks } \text{ over }\ \emptyset \ \text{ iff } \Gamma \wedge \phi ^-\ L\text{-forks } \text{ over }\ \emptyset. \end{aligned}$$We show that there is a greatest universal transducer \ and it is type-definable. (...) In particular, the forking topology on \\) refines the forking topology on \\) for all y. Moreover, we describe the set of universal transducers in terms of certain topology on the Stone space and show that \ is the unique universal transducer that is \-type-definable with parameters. If \ is a theory with the wnfcp and T is the theory of its lovely pairs of models we show that \\) and give a more precise description of the set of universal transducers for the special case where \ has the nfcp. (shrink)

Given an abstract logic L = L(Q i ) i ∈ I generated by a set of quantifiers Q i , one can construct for each type τ a topological space S τ exactly as one constructs the Stone space for τ in first-order logic. Letting T be an arbitrary directed set of types, the set $S_T = \{(S_\tau, \pi^\tau_\sigma)\mid\sigma, \tau \in T, \sigma \subset \tau\}$ is an inverse topological system whose bonding mappings π τ σ are naturally (...) determined by the reduct operation on structures. We relate the compactness of L to the topological properties of S T . For example, if I is countable then L is compact iff for every τ each clopen subset of S τ is of finite type and S τ is homeomorphic to $\underset{lim}S_T$ , where T is the set of finite subtypes of τ. We finally apply our results to concrete logics. (shrink)

The basic methodology of rough set theory depends on an equivalence relation induced from the generated partition by the classification of objects. However, the requirements of the equivalence relation restrict the field of applications of this philosophy. To begin, we describe two kinds of closure operators that are based on right and left adhesion neighbourhoods by any binary relation. Furthermore, we illustrate that the suggested techniques are an extension of previous methods that are already available in the literature. As (...) a result of these topological techniques, we propose extended rough sets as an extension of Pawlak’s models. We offer a novel topological strategy for making a topological reduction of an information system for COVID-19 based on these techniques. We provide this medical application to highlight the importance of the offered methodologies in the decision-making process to discover the important component for coronavirus infection. Furthermore, the findings obtained are congruent with those of the World Health Organization. Finally, we create an algorithm to implement the recommended ways in decision-making. (shrink)

One can use mathematics not as an instrument or measure, or a replacement for God, but as a poetic articulation, or perhaps as a stammered experimental approach to cultural dynamics. I choose to start with the simplest symbolic substances that respect the lifeworld’s continuous dynamism, temporality, boundless morphogenesis, superposability, continuity, density and value, and yet are independent of measure, metric, counting, finitude, formal logic, syntax, grammar, digitality and computability – in short, free of the formal structures that would put a (...) cage over all of the lifeworld. I call these substances topological media. This article introduces elementary topological concepts with which we can articulate material and cultural change using notions of proximity, limit, and change, without recourse to number or metric. The motivation is that topology furnishes us with concepts well-adapted for poietically articulating the world as stuff, rather than objects with an a priori schema. With care, it may provide a fruitful approach to morphogenesis and cultural dynamics that is neither reductive nor anthropocentric. I will not pretend any systematic application of the scaffolding concepts introduced in this article. Instead, I would see what fellow students of cultural dynamics and cosmopolitics make of these concepts in their own work. (shrink)

This article considers the following question: What is the relationship between supervenience and reduction? I investigate this formally: first, by introducing a recent argument by Christian List to the effect that one can have supervenience without reduction; then, by considering how the notion of Nagelian reduction can be related to the formal apparatus of definability and translation theory; then, by showing how, in the context of propositional theories, topological constraints on supervenience serve to enforce reducibility; (...) and, finally, by showing how constraints derived from the theory of ultraproducts can enforce reducibility in the context of first-order theories. (shrink)

Intertheoretic reduction in physics aspires to be both to be explanatory and perfectly general: it endeavors to explain why an older, simpler theory continues to be as successful as it is in terms of a newer, more sophisticated theory, and it aims to relate or otherwise account for as many features of the two theories as possible. Despite often being introduced as straightforward cases of intertheoretic reduction, candidate accounts of the reduction of general relativity to (...) Newtonian gravitation have either been insufficiently general or rigorous, or have not clearly been able to explain the empirical success of Newtonian gravitation. Building on work by Ehlers and others, I propose a different account of the reduction relation that is perfectly general and meets the explanatory demand one would make of it. In doing so, I highlight the role that a topology on the collection of all spacetimes plays in defining the relation, and how the selection of the topology corresponds with broader or narrower classes of observables that one demands be well-approximated in the limit. (shrink)

Dense pairs of geometric topological fields have tame open core, that is, every definable open subset in the pair is already definable in the reduct. We fix a minor gap in the published version of van den Dries's seminal work on dense pairs of o-minimal groups, and show that every definable unary function in a dense pair of geometric topological fields agrees with a definable function in the reduct, off a small definable subset, that is, a definable set (...) internal to the predicate. For certain dense pairs of geometric topological fields without the independence property, whenever the underlying set of a definable group is contained in the dense-codense predicate, the group law is locally definable in the reduct as a geometric topological field. If the reduct has elimination of imaginaries, we extend this result, up to interdefinability, to all groups internal to the predicate. (shrink)

Logic begins but does not end with the study of truth and falsity. Within truth there are the modes of truth, ways of being true: necessary truth and contingent truth. When a proposition is true, we may ask whether it could have been false. If so, then it is contingently true. If not, then it is necessarily true; it must be true; it could not have been false. Falsity has modes as well: a false proposition that could not have been (...) true is impossible or necessarily false; one that could have been true is merely contingently false. The proposition that some humans are over seven feet tall is contingently true; the proposition that all humans over seven feet tall are over six feet tall is necessarily true; the proposition that some humans are over seven feet tall and under six feet tall is impossible, and the proposition that some humans are over nine feet tall is contingently false. Of these four modes of truth, let us focus on necessity, plus a fifth: possibility. A proposition is possible if it is or could have been true; hence propositions that are either necessarily true, contingently true, or contingently false are possible. Notions that are similar to the modes of truth in being concerned with what might have been are called modal. Dispositions are modal notions, for example the disposition of fragility. Relatedly, there are counterfactual conditionals, for example “if this glass were dropped, it would break.” And the notion of supervenience is modal.1 But let us focus here on necessity and possibility. Modal words are notoriously ambiguous (or at least context-sensitive2). I may reply to an invitation to give a talk in England by saying “I can’t come; I have to give a talk in California the day before”. This use of “can’t” is perfectly appropriate. But it would be equally appropriate for me to say that I could cancel my talk in California (although that would be rude) and give the talk in England instead. What I cannot do is give both talks.. (shrink)

The non‐forking‐instances topology (NFI topology) is a topology on the Stone space of a theory T that depends on a reduct of T. This topology has been used in [6] to describe the set of universal transducers for (invariants sets that translate forking‐open sets in to forking‐open sets in T). In this paper we show that in contrast to the stable case, the NFI topology need not be invariant over parameters in but a weak version of this holds for (...) any simple T. We also note that for the lovely pair expansions, of theories with the weak non‐finite cover property (wnfcp), the topology is invariant over in. (shrink)

The first-order theory of the lattice of recursively enumerable closed subsets of an effective topological space is proved undecidable using the undecidability of the first-order theory of the lattice of recursively enumerable sets. In particular, the first-order theory of the lattice of recursively enumerable closed subsets of Euclidean n -space, for all n , is undecidable. A more direct proof of the undecidability of the lattice of recursively enumerable closed subsets of Euclidean n -space, n ⩾ (...) 2, is provided using the method of reduction and the recursive inseparability of the set of all formulae satisfiable in every model of the theory of SIBs and the set of all formulae refutable in some finite model of the theory of SIBs. (shrink)

With reference to recently proposed theoretical models accounting for reduction in terms of a unified dynamics governing all physical processes, we analyze the problem of working out a worldview accommodating our knowledge about natural phenomena. We stress the relevant conceptual differences between the considered models and standard quantum mechanics. In spite of the fact that both theories describe systems within a genuine Hilbert space framework, the peculiar features of the spontaneous reduction models limit drastically the states which are (...) dynamically stable. This fact by itself allows one to work out an interpretation of the formalism which makes it possible to give a satisfactory description of the world in terms of the values taken by an appropriately defined mass density function in ordinary configuration space. A topology based on this function and which is radically different from the one characterizing the Hilbert space is introduced, and in terms of it the idea of similarity of macroscopic situations is precisely defined. Finally, the formalism and the interpretation are shown to yield a natural criterion for establishing the psychophysical parallelism. The conclusion is that, within the considered theories and at the nonrelativistic level, one can satisfy all sensible requirements for a completely satisfactory macro-objective description of reality. (shrink)

Stone representation theorems are a central ingredient in the metatheory of philosophical logics and are used to establish modal embedding results in a general but indirect and non-constructive way. Their use in logical embeddings will be reviewed and it will be shown how they can be circumvented in favour of direct and constructive arguments through the methods of analytic proof theory, and how the intensional part of the representation results can be recovered from the syntactic proof of those embeddings. (...) Analytic methods will also be used to establish the embedding of subintuitionistic logics into the corresponding modal logics. Finally, proof-theoretic embeddings will be interpreted as a reduction of classes of word problems. (shrink)

It is difficult to wander far in contemporary metaphysics without bumping into talk of possible worlds. And, reference to possible worlds is not confined to metaphysics. It can be found in contemporary epistemology and ethics, and has even made its way into linguistics and decision theory. What are those possible worlds, the entities to which theorists in these disciplines all appeal? Some have hoped that a theory of possible worlds can be used to reduce modality to non-modal terms. (...) This paper sets reductive theories aside, and articulates and applies a framework for evaluating non-reductive theories of possible worlds. I argue that, if we abjure reduction, we should aim for a theory of possible worlds that is user-friendly. I then outline four leading contemporary theories and consider objections to each. My conclusions are negative: every theory we discuss fails to be user-friendly in some significant respect. (shrink)

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. (shrink)

The propositions, that what we see around us is real and that reality should be represented by the statevector, conflict with quantum theory. In quantum theory, the statevector can readily become a sum of states of comparable norm, each state representing a different reality. In this paper we present the Continuous Spontaneous Localization (CSL) theory, in which a modified Schrodinger equation, while scarcely affecting the dynamics of a microscopic system, rapidly "reduces" the statevector of a macroscopic system (...) to a state appropriate for representing individual reality. (shrink)

It is well known that, in the terminology of Moschovakis, Descriptive set theory (1980), every adequate normed pointclass closed under ∀ω has an effective version of the generalized reduction property (GRP) called the easy uniformization property (EUP). We prove a dual result: every adequate normed pointclass closed under ∃ω has the EUP. Moschovakis was concerned with the descriptive set theory of subsets of Polish topological spaces. We set up a general framework for parts of descriptive set (...) theory and prove results that have as special cases not only the just-mentioned topological results, but also corresponding results concerning the descriptive set theory of classes of structures. Vaught (1973) asked whether the class of cPCδ classes of countable structures has the GRP. It does. A cPC(A) class is the class of all models of a sentence of the form ¬∃K̄φ, where φ is a sentence of L∞ω that is in A and K̄ is a set of relation symbols that is in A. Vaught also asked whether there is any primitive recursively closed set A such that some effective version of the GRP holds for the class of cPC(A) classes of countable structures. There is: The class of cPC(A) classes of countable structures has the EUP if ω ∈ A and A is countable and primitive recursively closed. Those results and some extensions are obtained by first showing that the relevant classes of classes of structures, which Vaught showed normed, are in a suitable sense adequate and closed under ∃ω, and then applying the dual easy uniformization theorem. (shrink)

A nonstandard universe is constructed from a superstructure in a Boolean-valued model of set theory. This provides a new framework of nonstandard analysis with which methods of forcing are incorporated naturally. Various new principles in this framework are provided together with the following applications: An example of an 1-saturated Boolean ultrapower of the real number field which is not Scott complete is constructed. Infinitesimal analysis based on the generic extension of the hyperreal numbers is provided, and the hull completeness (...) theorem and the Loeb measure construction are extended to objects in the generic extension of the internal universe. The reduction theory of the Boolean-valued complex numbers are developed as a prototype of the applications to the topological reduction theory of Boolean sheaves or operator algebras. (shrink)

This paper examines an important but neglected topic in Suárez’s metaphysics–—namely, his theory of efficient causation. According to Suárez, efficient causation is to be identified with action, one of Aristotle’s ten highest genera or categories. The paper shows how Suárez’s identification of efficient causation with action helps to shed light on his views about the precise nature of efficient causation, and its role in his ontology. More specifically, it shows that Suárez understands efficient causation to be a distinctive or (...) sui generis type of entity, and that he thinks we must adopt this view in order to account for the facts of efficient causation. The paper also examines several objections to Suárez’s account. (shrink)

This proposes a new theory of Quantum measurement; a state reduction theory in which reduction is to the elements of the number operator basis of a system, triggered by the occurrence of annihilation or creation (or lowering or raising) operators in the time evolution of a system. It is from these operator types that the acronym ‘LARC’ is derived. Reduction does not occur immediately after the trigger event; it occurs at some later time with probability (...) P t per unit time, where P t is very small. Localisation of macroscopic objects occurs in the natural way: photons from an illumination field are reflected off a body and later absorbed by another body. Each possible absorption of a photon by a molecule in the second body generates annihilation and raising operators, which in turn trigger a probability per unit time P t of a state reduction into the number operator basis for the photon field and the number operator basis of the electron orbitals of the molecule. Since all photons in the illumination field have come from the location of the first body, wherever that is, a single reduction leads to a reduction of the position state of the first body relative to the second, with a total probability of mP t , where m is the number of photon absorption events. Unusually for a reduction theory, the larc theory is naturally relativistic. (shrink)

We dedicate these papers to the memory of John Bell, whose contributions to, support for, and encouragement of the research program described here has meant more than words can say to those involved in it.In Schrödinger’s “cat paradox” example, a nucleus which has a 50% probability of decaying within an hour is coupled to a cat by a “hellish contraption” which, if it detects the decay, will kill the cat. If we take the point of view that what we see (...) around us is real, what occurs in reality is one of the two following evolutions :(—> means “evolves in an hour into“).According to Schrödinger’s equation, the evolution of the statevector describing this situation isThe right hand side of Eq. (1.2) does not correspond to either the reality on the right hand side of (1.1a) nor to the reality on the right hand side of (1.1b). (shrink)

This article discusses a kind of knowledge classifiable as knowledge-wh but which seems to defy analysis in terms of the standard reductive theory of knowledge-wh ascriptions, according to which they are true if and only if one knows that p, where this proposition is an acceptable answer to the wh-question ‘embedded’ in the ascription. Specifically, it is argued that certain cases of knowing what an experience is like resist such treatment. I argue that in some of these cases, one (...) can know that p, where an acceptable answer to the question ‘What’s the experience like?’ is that p, but where one does not know what the experience is like. This could point to the distinctiveness of this sort of knowledge. (shrink)

Relationships between current theories, and relationships between current theories and the sought theory of quantum gravity (QG), play an essential role in motivating the need for QG, aiding the search for QG, and defining what would count as QG. Correspondence is the broad class of inter-theory relationships intended to demonstrate the necessary compatibility of two theories whose domains of validity overlap, in the overlap regions. The variety of roles that correspondence plays in the search for QG are illustrated, (...) using examples from specific QG approaches. Reduction is argued to be a special case of correspondence, and to form part of the definition of QG. Finally, the appropriate account of emergence in the context of QG is presented, and compared to conceptions of emergence in the broader philosophy literature. It is argued that, while emergence is likely to hold between QG and general relativity, emergence is not part of the definition of QG, and nor can it serve usefully in the development and justification of the new theory. (shrink)

In this paper, I present a general theory of topological explanations, and illustrate its fruitfulness by showing how it accounts for explanatory asymmetry. My argument is developed in three steps. In the first step, I show what it is for some topological property A to explain some physical or dynamical property B. Based on that, I derive three key criteria of successful topological explanations: a criterion concerning the facticity of topological explanations, i.e. what makes it (...) true of a particular system; a criterion for describing counterfactual dependencies in two explanatory modes, i.e. the vertical and the horizontal; and, finally, a third perspectival one that tells us when to use the vertical and when to use the horizontal mode. In the second step, I show how this general theory of topological explanations accounts for explanatory asymmetry in both the vertical and horizontal explanatory modes. Finally, in the third step, I argue that this theory is universally applicable across biological sciences, which helps to unify essential concepts of biological networks. (shrink)

Fundamental concrete particulars are needed to explain facts about non-fundamental concrete particulars. However, the former can only play this explanatory role if they are properly discernible from the latter. Extant theories of how to discern fundamental concreta primarily concern mereological structure. Those according to which fundamental concreta can bear, but not be, proper parts are motivated by the possibilities that all concreta bear proper parts and that some properties of wholes are not fixed by the properties of their proper parts. (...) In response, theorists who hold that the fundamental concrete particulars can be proper parts may appeal to the possibility that every concrete particular is a proper part—that there is no mereologically maximal whole world, as well as to the intuition that fundamental concreta are qualitatively homogeneous “blocks” from which non-fundamental concreta are built. After motivating the plausibility of gunk and junk, the present essay proposes a constraint on fundamental concrete particulars based on topology instead of mereology: the fundamental concrete particulars must be appropriately connected. This constraint has the unique advantage of consistency with each of gunk, emergence, junk, and the building block intuition. (shrink)

There are a number of different versions of Reductive Nominalism, versions distinguished by the way in which each accounts for facts about having and sharing properties. This chapter discusses three broad varieties of Reductive Nominalism: Predicate Nominalism, Class Nominalism, and Resemblance Nominalism. Class Nominalism identifies properties with classes or sets. Resemblance Nominalists come in two sub‐varieties, depending on whether they take the resemblance relation to hold between particular properties (called 'tropes') or particular things that have properties (ordinary particulars). Trope (...) class='Hi'>Theory comes in two varieties depending on whether one plumps for universals. It should not be difficult to see that Extreme Resemblance Nominalism is faced with Class Nominalism's extensionality problems, both the problem of contingent predication and the co‐extensive property problem. Resemblance Nominalists can reply by insisting on a distinction between a priori or conceptual equivalence and metaphysical equivalence. The chapter focuses on the extensionality problems for Class Nominalism. (shrink)

Stephen Hawking, among others, has proposed that the topological stability of a property of space-time is a necessary condition for it to be physically significant. What counts as stable, however, depends crucially on the choice of topology. Some physicists have thus suggested that one should find a canonical topology, a single ‘right’ topology for every inquiry. While certain such choices might be initially motivated, some little-discussed examples of Robert Geroch and some propositions of my own show that the main (...) candidates—and each possible choice, to some extent—faces the horns of a no-go result. I suggest that instead of trying to decide what the ‘right’ topology is for all problems, one should let the details of particular types of problems guide the choice of an appropriate topology. (shrink)

Post algebras of order + as a semantic foundation for +-valued predicate calculi were examined in [5]. In this paper Post spaces of order + being a modification of Post spaces of order n2 (cf. Traczyk [8], Dwinger [1], Rasiowa [6]) are introduced and Post fields of order + are defined. A representation theorem for Post algebras of order + as Post fields of sets is proved. Moreover necessary and sufficient conditions for the existence of representations preserving a given set (...) of infinite joins and infinite meets are established and applied to Lindenbaum-Tarski algebras of elementary theories based on +-valued predicate calculi in order to obtain a topological characterization of open theories. (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)

Working in constructive set theory we formulate notions of constructive topological space and set-generated locale so as to get a good constructive general version of the classical Galois adjunction between topological spaces and locales. Our notion of constructive topological space allows for the space to have a class of points that need not be a set. Also our notion of locale allows the locale to have a class of elements that need not be a set. Class (...) sized mathematical structures need to be allowed for in constructive set theory because the powerset axiom and the full separation scheme are necessarily missing from constructive set theory. We also consider the notion of a formal topology, usually treated in Intuitionistic type theory, and show that the category of set-generated locales is equivalent to the category of formal topologies. We exploit ideas of Palmgren and Curi to obtain versions of their results about when the class of formal points of a set-presentable formal topology form a set. (shrink)

This paper examines the nature of theory structure in biology and considers the implications of those theoretical structures for theory reduction. An account of biological theories as interlevel prototypes embodying causal sequences, and related to each other by strong analogies, is presented, and examples from the neurosciences are provided to illustrate these middle-range theories. I then go on to discuss several modifications of Nagel''s classical model of theory reduction, and indicate at what stages in the (...) development of reductions these models might best apply. Finally I consider several implications of these analyses of theory structure and reduction for disciplinary integration in biology. (shrink)

In order to establish patterns of materialization of the beliefs we are going to consider that these have defined mathematical structures. It will allow us to understand better processes of the textual, architectonic, normative, educative, etc., materialization of an ideology. The materialization is the conversion by means of certain mathematical correspondences, of an abstract set whose elements are beliefs or ideas, in an impure set whose elements are material or energetic. Text is a materialization of ideology and it is any (...) representation of the Reality represented by symbolic means. In all text T we can observe diverse topological structures: Metric Textual Space, Textual Topology and a Textual Lattice. (shrink)

. Relational semantics for nonclassical logics lead straightforwardly to topological representation theorems of their algebras. Ortholattices and De Morgan lattices are reducts of the algebras of various nonclassical logics. We define three new classes of topological spaces so that the lattice categories and the corresponding categories of topological spaces turn out to be dually isomorphic. A key feature of all these topological spaces is that they are ordered relational or ordered product topologies.

Philosophers of science since Nagel have been interested in the links between intertheoretic reduction and explanation, understanding and other forms of epistemic progress. Although intertheoretic reduction is widely agreed to occur in pure mathematics as well as empirical science, the relationship between reduction and explanation in the mathematical setting has rarely been investigated in a similarly serious way. This paper examines an important particular case: the reduction of arithmetic to set theory. I claim that the (...) reduction is unexplanatory. In defense of this claim, I offer evidence from mathematical practice, and I respond to contrary suggestions due to Steinhart, Maddy, Kitcher and Quine. I then show how, even if set-theoretic reductions are generally not explanatory, set theory can nevertheless serve as a legitimate foundation for mathematics. Finally, some implications of my thesis for philosophy of mathematics and philosophy of science are discussed. In particular, I suggest that some reductions in mathematics are probably explanatory, and I propose that differing standards of theory acceptance might account for the apparent lack of unexplanatory reductions in the empirical sciences. (shrink)

The standard construction of quotient spaces in topology uses full separation and power sets. We show how to make this construction using only the predicative methods available in constructive type theory and constructive set theory.

Using Butz and Moerdijk's topological groupoid representation of a topos with enough points, a ‘syntax-semantics’ duality for geometric theories is constructed. The emphasis is on a logical presentation, starting with a description of the semantic topological groupoid of models and isomorphisms of a theory. It is then shown how to extract a theory from equivariant sheaves on a topological groupoid in such a way that the result is a contravariant adjunction between theories and groupoids, the (...) restriction of which is a duality between theories with enough models and semantic groupoids. Technically a variant of the syntax-semantics duality constructed in 1 for first-order logic, the construction here works for arbitrary geometric theories and uses a slice construction on the side of groupoids—reflecting the use of ‘indexed’ models in the representation theorem—which in several respects simplifies the construction and the characterization of semantic groupoids. (shrink)

The paper sets out a new strategy for theory reduction by means of functional sub-types. This strategy is intended to get around the multiple realization objection. We use Kim's argument for token identity (ontological reductionism) based on the causal exclusion problem as starting point. We then extend ontological reductionism to epistemological reductionism (theory reduction). We show how one can distinguish within any functional type between functional sub-types. Each of these sub-types is coextensive with one type of (...) realizer. By this means, a conservative theory reduction is in principle possible, despite multiple realization. We link this account with Nagelian reduction, as well as with Kim's functional reduction. (shrink)

This paper studies the topological duality between diagonalizable algebras and bi-topological spaces. In particular, the correspondence between algebraic properties of a diagonalizable algebra and topological properties of its dual space is investigated. Since the main example of a diagonalizable algebra is the Lindenbaum algebra of an r.e. theory extending Peano Arithmetic, endowed with an operator defined by means of the provability predicate of the theory, this duality gives the possibility to study arithmetical properties of theories (...) from a topological point of view. We find topological characterization of $\Sigma_1$-sound theories and of sentences that are $\Sigma_1$-conservative over such a theory. (shrink)