Results for 'Closure and interior operation'

979 found
Order:
  1.  43
    A constructive Galois connection between closure and interior.Francesco Ciraulo & Giovanni Sambin - 2012 - Journal of Symbolic Logic 77 (4):1308-1324.
    We construct a Galois connection between closure and interior operators on a given set. All arguments are intuitionistically valid. Our construction is an intuitionistic version of the classical correspondence between closure and interior operators via complement.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  2.  33
    A Proof of Tarski’s Fixed Point Theorem by Application of Galois Connections.Marek Nowak - 2015 - Studia Logica 103 (2):287-301.
    Two examples of Galois connections and their dual forms are considered. One of them is applied to formulate a criterion when a given subset of a complete lattice forms a complete lattice. The second, closely related to the first, is used to prove in a short way the Knaster-Tarski’s fixed point theorem.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  3.  64
    On Dynamic Topological and Metric Logics.B. Konev, R. Kontchakov, F. Wolter & M. Zakharyaschev - 2006 - Studia Logica 84 (1):129-160.
    We investigate computational properties of propositional logics for dynamical systems. First, we consider logics for dynamic topological systems (W.f), fi, where W is a topological space and f a homeomorphism on W. The logics come with ‘modal’ operators interpreted by the topological closure and interior, and temporal operators interpreted along the orbits {w, f(w), f2 (w), ˙˙˙} of points w ε W. We show that for various classes of topological spaces the resulting logics are not recursively enumerable (and (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  4.  77
    A modal logic framework for reasoning about comparative distances and topology.Mikhail Sheremet, Frank Wolter & Michael Zakharyaschev - 2010 - Annals of Pure and Applied Logic 161 (4):534-559.
    We propose and investigate a uniform modal logic framework for reasoning about topology and relative distance in metric and more general distance spaces, thus enabling the comparison and combination of logics from distinct research traditions such as Tarski’s for topological closure and interior, conditional logics, and logics of comparative similarity. This framework is obtained by decomposing the underlying modal-like operators into first-order quantifier patterns. We then show that quite a powerful and natural fragment of the resulting first-order logic (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  5.  67
    Operational closure and stability.Gerhard Jäger - 2013 - Annals of Pure and Applied Logic 164 (7-8):813-821.
    In this article we introduce and study the notion of operational closure: a transitive set d is called operationally closed iff it contains all constants of OST and any operation f∈d applied to an element a∈d yields an element fa∈d, provided that f applied to a has a value at all. We will show that there is a direct relationship between operational closure and stability in the sense that operationally closed sets behave like Σ1 substructures of the (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  6.  81
    A Logic for Metric and Topology.Frank Wolter & Michael Zakharyaschev - 2005 - Journal of Symbolic Logic 70 (3):795 - 828.
    We propose a logic for reasoning about metric spaces with the induced topologies. It combines the 'qualitative' interior and closure operators with 'quantitative' operators 'somewhere in the sphere of radius r.' including or excluding the boundary. We supply the logic with both the intended metric space semantics and a natural relational semantics, and show that the latter (i) provides finite partial representations of (in general) infinite metric models and (ii) reduces the standard '∈-definitions' of closure and (...) to simple constraints on relations. These features of the relational semantics suggest a finite axiomatisation of the logic and provide means to prove its EXPTIME-completeness (even if the rational numerical parameters are coded in binary). An extension with metric variables satisfying linear rational (in)equalities is proved to be decidable as well. Our logic can be regarded as a 'well-behaved' common denominator of logical systems constructed in temporal, spatial, and similarity-based quantitative and qualitative representation and reasoning. Interpreted on the real line (with its Euclidean metric), it is a natural fragment of decidable temporal logics for specification and verification of real-time systems. On the real plane, it is closely related to quantitative and qualitative formalisms for spatial representation and reasoning, but this time the logic becomes undecidable. (shrink)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  7.  64
    Fuzzy Galois connections on fuzzy posets.Wei Yao & Ling-Xia Lu - 2009 - Mathematical Logic Quarterly 55 (1):105-112.
    The concept of fuzzy Galois connections is defined on fuzzy posets with Bělohlávek's fuzzy Galois connections as a special case. The properties of fuzzy Galois connections are investigated. Then the relations between fuzzy Galois connections and fuzzy closure operators, fuzzy interior operators are studied.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  8.  10
    Interior Operators and Their Relationship to Autocatalytic Networks.Mike Steel - 2023 - Acta Biotheoretica 71 (4).
    The emergence of an autocatalytic network from an available set of elements is a fundamental step in early evolutionary processes, such as the origin of metabolism. Given the set of elements, the reactions between them (chemical or otherwise), and with various elements catalysing certain reactions, a Reflexively Autocatalytic F-generated (RAF) set is a subset R′\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$'$$\end{document} of reactions that is self-generating from a given food set, and with each reaction in R′\documentclass[12pt]{minimal} \usepackage{amsmath} (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  9.  62
    Symmetry, Compact Closure and Dagger Compactness for Categories of Convex Operational Models.Howard Barnum, Ross Duncan & Alexander Wilce - 2013 - Journal of Philosophical Logic 42 (3):501-523.
    In the categorical approach to the foundations of quantum theory, one begins with a symmetric monoidal category, the objects of which represent physical systems, and the morphisms of which represent physical processes. Usually, this category is taken to be at least compact closed, and more often, dagger compact, enforcing a certain self-duality, whereby preparation processes (roughly, states) are interconvertible with processes of registration (roughly, measurement outcomes). This is in contrast to the more concrete “operational” approach, in which the states and (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  10.  74
    A Topological Approach to Full Belief.Alexandru Baltag, Nick Bezhanishvili, Aybüke Özgün & Sonja Smets - 2019 - Journal of Philosophical Logic 48 (2):205-244.
    Stalnaker, 169–199 2006) introduced a combined epistemic-doxastic logic that can formally express a strong concept of belief, a concept of belief as ‘subjective certainty’. In this paper, we provide a topological semantics for belief, in particular, for Stalnaker’s notion of belief defined as ‘epistemic possibility of knowledge’, in terms of the closure of the interior operator on extremally disconnected spaces. This semantics extends the standard topological interpretation of knowledge with a new topological semantics for belief. We prove that (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  11.  18
    Roughness of Filters in Equality Algebras.Gholam Reza Rezaei, Rajab Ali Borzooei, Mona Aaly Kologani & Young Bae Jun - 2023 - Bulletin of the Section of Logic 52 (1):1-18.
    Rough set theory is an excellent mathematical tool for the analysis of a vague description of actions in decision problems. Now, in this paper by considering the notion of an equality algebra, the notion of the lower and the upper approximations are introduced and some properties of them are given. Moreover, it is proved that the lower and the upper approximations define an interior operator and a closure operator, respectively. Also, using D-lower and D-upper approximation, conditions for a (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12.  15
    Semantic Closure and Classicality.Edson Bezerra - 2023 - Revista de Humanidades de Valparaíso 22:85-103.
    Las paradojas semánticas muestran que las teorías semánticas que internalizan sus propios conceptos semánticos, como la verdad y la validez, no pueden validar toda la lógica clásica. Es decir, es necesario debilitar algún conectivo del lenguaje objeto, tomado como culpable de las paradojas, o renunciar a alguna propiedad de la relación de consecuencia de la teoría lógica. Ambas estrategias pueden alejarnos de la lógica clásica, que es la lógica comúnmente utilizada en nuestras teorías matemáticas actuales. Por tanto, una solución deseable (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13. Knowledge Closure and Knowledge Openness: A Study of Epistemic Closure Principles.Levi Spectre - 2009 - Stockholm: Stockholm University.
    The principle of epistemic closure is the claim that what is known to follow from knowledge is known to be true. This intuitively plausible idea is endorsed by a vast majority of knowledge theorists. There are significant problems, however, that have to be addressed if epistemic closure – closed knowledge – is endorsed. The present essay locates the problem for closed knowledge in the separation it imposes between knowledge and evidence. Although it might appear that all that stands (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  14.  33
    Interiority, Cognitional Operations, and Aesthetic Judgment: In Dialogue with John Dadosky and Mikel Dufrenne.James R. Pambrun - 2014 - Philosophy and Theology 26 (2):307-341.
    This article proposes to elaborate aesthetic judgment. The context is John Dadosky’s call for such an elaboration in light of the theological and philosophical import of a recovery of beauty. Following Dadosky’s suggestion that this be set within Lonergan’s appeal to interiority, the article signals two points in Dadosky’s program: patterns of experience and the role of cognitional operations. The article turns to Mikel Dufrenne’s work on the phenomenology of aesthetic experience. Based on this work, data is presented on behalf (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  15.  16
    The Baire Closure and its Logic.G. Bezhanishvili & D. Fernández-Duque - 2024 - Journal of Symbolic Logic 89 (1):27-49.
    The Baire algebra of a topological space X is the quotient of the algebra of all subsets of X modulo the meager sets. We show that this Boolean algebra can be endowed with a natural closure operator, resulting in a closure algebra which we denote $\mathbf {Baire}(X)$. We identify the modal logic of such algebras to be the well-known system $\mathsf {S5}$, and prove soundness and strong completeness for the cases where X is crowded and either completely metrizable (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16.  26
    Conservativity of Transitive Closure over weak operational set theory.Laura Crosilla & Andrea Cantini - 2012 - In Ulrich Berger, Hannes Diener, Peter Schuster & Monika Seisenberger (eds.), Logic, Construction, Computation. De Gruyter.
    Constructive set theory a' la Myhill-Aczel has been extended in (Cantini and Crosilla 2008, Cantini and Crosilla 2010) to incorporate a notion of (partial, non--extensional) operation. Constructive operational set theory is a constructive and predicative analogue of Beeson's Inuitionistic set theory with rules and of Feferman's Operational set theory (Beeson 1988, Feferman 2006, Jaeger 2007, Jaeger 2009, Jaeger 1009b). This paper is concerned with an extension of constructive operational set theory (Cantini and Crosilla 2010) by a uniform operation (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  17.  37
    Graded consequence relations and fuzzy closure operator.Giangiacomo Gerla - 1996 - Journal of Applied Non-Classical Logics 6 (4):369-379.
    ABSTRACT In this work the connections between the fuzzy closure operators and the graded consequence relations are examined Namely, as it is well known, in the crisp case there is a complete equivalence between the notion of closure operator and the one of consequence relation. We extend this result by proving that the graded consequence relations are related to a particular class of fuzzy closure operators, namely the class of fuzzy closure operators that can be obtained (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  18.  16
    Embedding sheaf models for set theory into boolean-valued permutation models with an interior operator.Andre Scedrov - 1986 - Annals of Pure and Applied Logic 32:103-109.
  19.  12
    Closure Operators on Complete Almost Distributive Lattices-III.Calyampudi Radhakrishna Rao & Venugopalam Undurthi - 2015 - Bulletin of the Section of Logic 44 (1/2):81-93.
    In this paper, we prove that the lattice of all closure operators of a complete Almost Distributive Lattice L with fixed maximal element m is dual atomistic. We define the concept of a completely meet-irreducible element in a complete ADL and derive a necessary and sufficient condition for a dual atom of Φ (L) to be complemented.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20. Complexity and “Closure to Efficient Cause”.Anthony Chemero & Michael T. Turvey - unknown
    This paper has two main purposes. First, it will provide an introductory discussion of hyperset theory, and show that it is useful for modeling complex systems. Second, it will use hyperset theory to analyze Robert Rosen’s metabolismrepair systems and his claim that living things are closed to efficient cause. It will also briefly compare closure to efficient cause to two other understandings of autonomy, operational closure and catalytic closure.
     
    Export citation  
     
    Bookmark   2 citations  
  21.  54
    Spatial logic of tangled closure operators and modal mu-calculus.Robert Goldblatt & Ian Hodkinson - 2017 - Annals of Pure and Applied Logic 168 (5):1032-1090.
  22.  45
    Contemplative Interiority and Human Development.T. R. Raghunath - 2008 - Proceedings of the Xxii World Congress of Philosophy 8:209-235.
    This paper will present an alternative to the mainstream Western approach to human development. The mainstream Western approach to human development does not countenance contemplative interiority as a means of cognitive inquiry and a domain of cognitive value. Hence, its conception of human development is narrowly confined to the domain of formal-operational thinking and its application to material exteriority. The alternative I will present is the work of the twentieth Indian philosopher Aurobindo (1872–1950) whose integral theory of human of development (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  23.  89
    Closure operators and complete embeddings of residuated lattices.Hiroakira Ono - 2003 - Studia Logica 74 (3):427 - 440.
    In this paper, a theorem on the existence of complete embedding of partially ordered monoids into complete residuated lattices is shown. From this, many interesting results on residuated lattices and substructural logics follow, including various types of completeness theorems of substructural logics.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  24.  24
    Precovers, Modalities and Universal Closure Operators in a Topos.John L. Bell & Silvia Gebellato - 1996 - Mathematical Logic Quarterly 42 (1):289-299.
    In this paper we develop the notion of formal precover in a topos by defining a relation between elements and sets in a local set theory. We show that such relations are equivalent to modalities and to universal closure operators. Finally we prove that these relations are well characterized by a convenient restriction to a particular set.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  25.  29
    A phase semantics for polarized linear logic and second order conservativity.Masahiro Hamano & Ryo Takemura - 2010 - Journal of Symbolic Logic 75 (1):77-102.
    This paper presents a polarized phase semantics, with respect to which the linear fragment of second order polarized linear logic of Laurent [15] is complete. This is done by adding a topological structure to Girard's phase semantics [9]. The topological structure results naturally from the categorical construction developed by Hamano—Scott [12]. The polarity shifting operator ↓ (resp. ↑) is interpreted as an interior (resp. closure) operator in such a manner that positive (resp. negative) formulas correspond to open (resp. (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  26.  71
    Contraction and closure.David Ripley - 2015 - Thought: A Journal of Philosophy 4 (2):131-138.
    In this paper, I consider the connection between consequence relations and closure operations. I argue that one familiar connection makes good sense of some usual applications of consequence relations, and that a largeish family of familiar noncontractive consequence relations cannot respect this familiar connection.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  27.  20
    One- and two-operator versions of a two-phase model applied to the performances of Vs and Cs in human eyelid conditioning.William F. Prokasy & Karol L. Kumpfer - 1969 - Journal of Experimental Psychology 80 (2p1):231.
  28.  98
    Representations of structural closure operators.José Gil-Férez - 2011 - Archive for Mathematical Logic 50 (1-2):45-73.
    We continue the work of Blok and Jónsson by developing the theory of structural closure operators and introducing the notion of a representation between them. Similarities and equivalences of Blok-Jónsson turn out to be bijective representations and bijective structural representations, respectively. We obtain a characterization for representations induced by a transformer. In order to obtain a similar characterization for structural representations we introduce the notions of a graduation and a graded variable of an M-set. We show that several deductive (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  29.  40
    The Issue of “Closure” in Jagers op Akkerhuis’s Operator Theory.Nico M. van Straalen - 2011 - Foundations of Science 16 (4):319-321.
    Attempts to define life should focus on the transition from molecules to cells and the “closure” aspects of this event. Rather than classifying existing objects into living and non-living entities I believe the challenge is to understand how the transition from non-life to life can take place, that is, the how the closure in Jagers op Akkerhuis’s hierarchical classification of operators, comes about.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  30. Cornea, Carnap, and Current Closure Befuddlement.Stephen J. Wykstra - 2007 - Faith and Philosophy 24 (1):87-98.
    Graham and Maitzen think my CORNEA principle is in trouble because it entails “intolerable violations of closure under known entailment.” I argue that the trouble arises from current befuddlement about closure itself, and that a distinction drawn by Rudolph Carnap, suitably extended, shows how closure, when properly understood, works in tandem with CORNEA. CORNEA does not obey Closure because it shouldn’t: it applies to “dynamic” epistemic operators, whereas closure principles hold only for “static” ones. What (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  31.  69
    Semantic closure, descriptions and non-triviality.Graham Priest - 1999 - Journal of Philosophical Logic 28 (6):549--558.
    It is known that a semantically closed theory with description may well be trivial if the principles concerning denotation and descriptions are formulated in certain ways, even if the underlying logic is paraconsistent. This paper establishes the nontriviality of a semantically closed theory with a natural, but non-extensional, description operator.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  32.  65
    The lattice of distributive closure operators over an algebra.Josep M. Font & Ventura Verdú - 1993 - Studia Logica 52 (1):1 - 13.
    In our previous paper Algebraic Logic for Classical Conjunction and Disjunction we studied some relations between the fragmentL of classical logic having just conjunction and disjunction and the varietyD of distributive lattices, within the context of Algebraic Logic. The central tool in that study was a class of closure operators which we calleddistributive, and one of its main results was that for any algebraA of type (2,2) there is an isomorphism between the lattices of allD-congruences ofA and of all (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  33.  30
    Epistemic Coverage and Argument Closure.Catherine E. Hundleby - 2020 - Topoi 40 (5):1051-1062.
    Sanford Goldberg’s account of epistemic coverage constitutes a special case of Douglas Walton’s view that epistemic closure arises from dialectical argument. Walton’s pragmatic version of epistemic closure depends on dialectical norms for closing an argument, and epistemic coverage operates at the limits of argument closure because it minimizes dialectical exchange. Such closure works together with a shared hypothetical consideration to justify dismissal of surprising claims.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  34.  20
    Context-sensitive transitive closure operators.Iain A. Stewart - 1994 - Annals of Pure and Applied Logic 66 (3):277-301.
    We introduce a new logical operator CSTC and show that incorporating this operator into first-order logic enables as to capture the complexity class PSPACE. We also show that by varying how the operator is applied we can capture the complexity classes P, NP, the classes of the Polynomial Hierarchy PH, and PSPACE. As such, the operator CSTC can be regarded as a general purpose operator. We also give applications of these characterizations by showing that P and NP coincide with those (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  35.  23
    On the operations definable in terms of the complementation and the closure.Stanis law Wronski - 1986 - Bulletin of the Section of Logic 15 (3):117-121.
  36.  80
    Operational set theory and small large cardinals.Solomon Feferman with with R. L. Vaught - manuscript
    “Small” large cardinal notions in the language of ZFC are those large cardinal notions that are consistent with V = L. Besides their original formulation in classical set theory, we have a variety of analogue notions in systems of admissible set theory, admissible recursion theory, constructive set theory, constructive type theory, explicit mathematics and recursive ordinal notations (as used in proof theory). On the face of it, it is surprising that such distinctively set-theoretical notions have analogues in such disaparate and (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  37.  38
    Giving an Account of Oneself (review).Chris Lundberg - 2007 - Philosophy and Rhetoric 40 (3):329-333.
    In lieu of an abstract, here is a brief excerpt of the content:Reviewed by:Giving an Account of OneselfChris LundbergGiving an Account of Oneself. Judith Butler. New York: Fordham University Press, 2005. Pp. x + 149. $18.95, softcover.Giving an Account of Oneself, Judith Butler's recent foray into moral philosophy, is a lucid interrogation of the problem of responsibility in the wake of contemporary critiques of the subject. In it, Butler moves beyond her concern with the conditions of subjectivity and its performances (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  38.  24
    Grounding operators: transitivity and trees, logicality and balance.Francesco A. Genco - 2024 - Journal of Applied Non-Classical Logics 34 (4):453-492.
    We formally investigate immediate and mediate grounding operators from an inferential perspective. We discuss the differences in behaviour displayed by several grounding operators and consider a general distinction between grounding and logical operators. Without fixing a particular notion of grounding or grounding relation, we present inferential rules that define, once a base grounding calculus has been fixed, three grounding operators: an operator for immediate grounding, one for mediate grounding – corresponding to the transitive closure of the immediate grounding one (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  39.  16
    Constructing a Hoop Using Rough Filters.Rajab Ali Borzooei & Elham Babaei - 2022 - Bulletin of the Section of Logic 51 (3):363-382.
    When it comes to making decisions in vague problems, rough is one of the best tools to help analyzers. So based on rough and hoop concepts, two kinds of approximations (Lower and Upper) for filters in hoops are defined, and then some properties of them are investigated by us. We prove that these approximations- lower and upper- are interior and closure operators, respectively. Also after defining a hyper operation in hoops, we show that by using this hyper (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40. Knowability and a modal closure principle.Berit Brogaard & Joe Salerno - 2006 - American Philosophical Quarterly 43 (3):261-270.
    Does a factive conception of knowability figure in ordinary use? There is some reason to think so. ‘Knowable’ and related terms such as ‘discoverable’, ‘observable’, and ‘verifiable’ all seem to operate factively in ordinary discourse. Consider the following example, a dialog between colleagues A and B: A: We could be discovered. B: Discovered doing what? A: Someone might discover that we're having an affair. B: But we are not having an affair! A: I didn’t say that we were. A’s remarks (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  41.  32
    Hierarchies in transitive closure logic, stratified Datalog and infinitary logic.Erich Grädel & Gregory L. McColm - 1996 - Annals of Pure and Applied Logic 77 (2):169-199.
    We establish a general hierarchy theorem for quantifier classes in the infinitary logic L∞ωωon finite structures. In particular, it is shown that no infinitary formula with bounded number of universal quantifiers can express the negation of a transitive closure.This implies the solution of several open problems in finite model theory: On finite structures, positive transitive closure logic is not closed under negation. More generally the hierarchy defined by interleaving negation and transitive closure operators is strict. This proves (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  42. Supervenience and infinitary property-forming operations.Ralf M. Bader - 2012 - Philosophical Studies 160 (3):415-423.
    This paper provides an account of the closure conditions that apply to sets of subvening and supervening properties, showing that the criterion that determines under which property-forming operations a particular family of properties is closed is applicable both to the finitary and to the infinitary case. In particular, it will be established that, contra Glanzberg, infinitary operations do not give rise to any additional difficulties beyond those that arise in the finitary case.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  43. The End Times of Philosophy.François Laruelle - 2012 - Continent 2 (3):160-166.
    Translated by Drew S. Burk and Anthony Paul Smith. Excerpted from Struggle and Utopia at the End Times of Philosophy , (Minneapolis: Univocal Publishing, 2012). THE END TIMES OF PHILOSOPHY The phrase “end times of philosophy” is not a new version of the “end of philosophy” or the “end of history,” themes which have become quite vulgar and nourish all hopes of revenge and powerlessness. Moreover, philosophy itself does not stop proclaiming its own death, admitting itself to be half dead (...)
    No categories
     
    Export citation  
     
    Bookmark   1 citation  
  44.  33
    CODI: A multidimensional theory of mereotopology with closure operations.Torsten Hahmann - 2020 - Applied ontology 15 (3):251-311.
    Geometric data models form the backbone of virtually all spatial information systems, such as GIS, CAD, and CAM. Yet a lot of spatial information from textual sources, including historical document...
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  45.  80
    Fuzzy closure systems on L-ordered sets.Lankun Guo, Guo-Qiang Zhang & Qingguo Li - 2011 - Mathematical Logic Quarterly 57 (3):281-291.
    In this paper, notions of fuzzy closure system and fuzzy closure L—system on L—ordered sets are introduced from the fuzzy point of view. We first explore the fundamental properties of fuzzy closure systems. Then the correspondence between fuzzy closure systems and fuzzy closure operators is established. Finally, we study the connections between fuzzy closure systems and fuzzy Galois connections. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  46.  38
    Universality of the closure space of filters in the algebra of all subsets.Andrzej W. Jankowski - 1985 - Studia Logica 44 (1):1 - 9.
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  47.  24
    The Ultrafilter Closure in ZF.Gonçalo Gutierres - 2010 - Mathematical Logic Quarterly 56 (3):331-336.
    It is well known that, in a topological space, the open sets can be characterized using ?lter convergence. In ZF , we cannot replace filters by ultrafilters. It is proven that the ultra?lter convergence determines the open sets for every topological space if and only if the Ultrafilter Theorem holds. More, we can also prove that the Ultra?lter Theorem is equivalent to the fact that uX = kX for every topological space X, where k is the usual Kuratowski closure (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  48.  25
    From Interior Algebras to Unital ℓ-Groups: A Unifying Treatment of Modal Residuated Lattices.William Young - 2015 - Studia Logica 103 (2):265-286.
    Much work has been done on specific instances of residuated lattices with modal operators . In this paper, we develop a general framework that subsumes three important classes of modal residuated lattices: interior algebras, Abelian ℓ-groups with conuclei, and negative cones of ℓ-groups with nuclei. We then use this framework to obtain results about these three cases simultaneously. In particular, we show that a categorical equivalence exists in each of these cases. The approach used here emphasizes the role played (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49.  92
    Some closure properties of finite definitions.Maricarmen Martinez - 2001 - Studia Logica 68 (1):43-68.
    There is no known syntactic characterization of the class of finite definitions in terms of a set of basic definitions and a set of basic operators under which the class is closed. Furthermore, it is known that the basic propositional operators do not preserve finiteness. In this paper I survey these problems and explore operators that do preserve finiteness. I also show that every definition that uses only unary predicate symbols and equality is bound to be finite.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  50.  59
    Disjunctions in closure spaces.Andrzej W. Jankowski - 1985 - Studia Logica 44 (1):11 - 24.
    The main result of this paper is the following theorem: a closure space X has an , , Q-regular base of the power iff X is Q-embeddable in It is a generalization of the following theorems:(i) Stone representation theorem for distributive lattices ( = 0, = , Q = ), (ii) universality of the Alexandroff's cube for T 0-topological spaces ( = , = , Q = 0), (iii) universality of the closure space of filters in the lattice (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 979