Based on the concepts of pseudocomplement of L -subsets and the implication operator where L is a completely distributive lattice with order-reversing involution, the definition of countable RL -fuzzy compactness degree and the Lindelöf property degree of an L -subset in RL -fuzzy topology are introduced and characterized. Since L -fuzzy topology in the sense of Kubiak and Šostak is a special case of RL -fuzzy topology, the degrees of RL -fuzzy compactness and the Lindelöf property are generalizations of the (...) corresponding degrees in L -fuzzy topology. (shrink)

In this book the authors introduce and study the following notions: Neutrosophic Crisp Points, Neutrosophic Crisp Relations, Neutrosophic Crisp Sets, Neutrosophic Set Generated by (Characteristic Function), alpha-cut Level for Neutrosophic Sets, Neutrosophic Crisp Continuous Function, Neutrosophic Crisp Compact Spaces, Neutrosophic Crisp Nearly Open Sets, Neutrosophic Crisp Ideals, Neutrosophic Crisp Filter, Neutrosophic Crisp Local Functions, Neutrosophic Crisp Sets via Neutrosophic Crisp Ideals, Neutrosophic Crisp L-Openness and Neutrosophic Crisp L-Continuity, Neutrosophic Topological Region, Neutrosophic Closed Set and Neutrosophic Continuous Function, etc. They (...) compute the distances between neutrosophic sets and extend it to Neutrosophic Hesitancy Degree. The authors also generalize the Crisp Topological Space and Intuitionistic Topological Space to the notion of Neutrosophic Crisp Topological Space. At the end, they present applications to Neutrosophic Database, and show a security scheme based on Public Key Infrastructure (PKI) using Neutrosophic Logic Manipulation. The authors utilize neutrosophic sets in order to analyze social networks data conducted through learning activities, and for the Geographical Information Systems (GIS) they employ fundamental concepts and properties of a Neutrosophic Spatial Region. Keywords: Neutrosophic Crisp Points; Neutrosophic Crisp Relations; Neutrosophic Crisp Sets; Neutrosophic Crisp Continuous Function; Neutrosophic Crisp Compact Spaces; Neutrosophic Crisp Nearly Open Sets; Neutrosophic Crisp Ideals; Neutrosophic Crisp Filter; Neutrosophic Crisp Local Functions; Neutrosophic Crisp Sets via Neutrosophic Crisp Ideals; Neutrosophic Crisp L-Openness and Neutrosophic Crisp L-Continuity; Neutrosophic Topological Region; Neutrosophic Closed Set and Neutrosophic Continuous Function; Neutrosophic Hesitancy Degree; Neutrosophic Crisp Topological Space; Neutrosophic Database; Neutrosophic Logic Manipulation; Neutrosophic Spatial Region. (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)

The main purpose of this note is to characterize consistency of logic theories in propositional logic by means of topological concept. Based on the concepts of truth degree of formulas and similarity degree between formulas the concept of logic metric space has been proposed by the first author. It is proved in this note that a closed logic theory Γ is consistent if and only if it contains no interior point in the logic metric space. Moreover the (...) relationship between logic closedness and topological closedness of a logic theory Γ is discussed. Finally, the concept of full divergency is also characterized by means of the topological concept of density. (shrink)

The brain displays both the anatomical features of a vast amount of interconnected topological mappings as well as the functional features of a nonlinear, metastable system at the edge of chaos, equipped with a phase space where mental random walks tend towards lower energetic basins. Nevertheless, with the exception of some advanced neuro-anatomic descriptions and present-day connectomic research, very few studies have been addressing the topological path of a brain embedded or embodied in its external and internal (...) environment. Herein, by using new formal tools derived from algebraic topology, we provide an account of the metastable brain, based on the neuro-scientific model of Operational Architectonics of brain-mind functioning. We introduce a “topodynamic” description that shows how the relationships among the countless intertwined spatio-temporal levels of brain functioning can be assessed in terms of projections and mappings that take place on abstract structures, equipped with different dimensions, curvatures and energetic constraints. Such a topodynamical approach, apart from providing a biologically plausible model of brain function that can be operationalized, is also able to tackle the issue of a long-standing dichotomy: it throws indeed a bridge between the subjective, immediate datum of the naïve complex of sensations and mentations and the objective, quantitative, data extracted from experimental neuro-scientific procedures. Importantly, it opens the door to a series of new predictions and future directions of advancement for neuroscientific research. (shrink)

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)

We find some characterizations of the Axiom of Choice in terms of certain families of open sets in T1 spaces.

In this paper we shall introduce the variety FWHA of frontal weak Heyting algebras as a generalization of the frontal Heyting algebras introduced by Leo Esakia in [ 10 ]. A frontal operator in a weak Heyting algebra A is an expansive operator τ preserving finite meets which also satisfies the equation $${\tau(a) \leq b \vee (b \rightarrow a)}$$, for all $${a, b \in A}$$. These operators were studied from an algebraic, logical and topological point of view by Leo (...) Esakia in [ 10 ]. We will study frontal operators in weak Heyting algebras and we will consider two examples of them. We will give a Priestley duality for the category of frontal weak Heyting algebras in terms of relational spaces $${\langle X, \leq, T, R \rangle}$$ where $${\langle X, \leq, T \rangle}$$ is a WH -space [ 6 ], and R is an additional binary relation used to interpret the modal operator. We will also study the WH -algebras with successor and the WH -algebras with gamma. For these varieties we will give two topological dualities. The first one is based on the representation given for the frontal weak Heyting algebras. The second one is based on certain particular classes of WH -spaces. (shrink)

In this paper we study the variety \(\textsf{WL}\) of bounded distributive lattices endowed with an implication, called weak Lewis distributive lattices. This variety corresponds to the algebraic semantics of the \(\{\vee,\wedge,\Rightarrow,\bot,\top \}\) -fragment of the arithmetical base preservativity logic \(\mathsf {iP^{-}}\). The variety \(\textsf{WL}\) properly contains the variety of bounded distributive lattices with strict implication, also known as weak Heyting algebras. We introduce the notion of WL-frame and we prove a representation theorem for WL-lattices by means of WL-frames. We (...) extended this representation to a topological duality by means of Priestley spaces endowed with a special neighbourhood relation between points and closed upsets of the space. These results are applied in order to give a representation and a topological duality for the variety of weak Heyting–Lewis algebras, i.e., for the algebraic semantics of the arithmetical base preservativity logic \(\textsf{iP}^{-}\). (shrink)

We propose a multi-agent logic of knowledge, public announcements and arbitrary announcements, interpreted on topological spaces in the style of subset space semantics. The arbitrary announcement modality functions similarly to the effort modality in subset space logics, however, it comes with intuitive and semantic differences. We provide axiomatizations for three logics based on this setting, with S5 knowledge modality, and demonstrate their completeness. We moreover consider the weaker axiomatizations of three logics with S4 type of knowledge and (...) prove soundness and completeness results for these systems. (shrink)

We propose a multi-agent logic of knowledge, public announcements and arbitrary announcements, interpreted on topological spaces in the style of subset space semantics. The arbitrary announcement modality functions similarly to the effort modality in subset space logics, however, it comes with intuitive and semantic differences. We provide axiomatizations for three logics based on this setting, with S5 knowledge modality, and demonstrate their completeness. We moreover consider the weaker axiomatizations of three logics with S4 type of knowledge and (...) prove soundness and completeness results for these systems. (shrink)

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 the belief logic KD45 is sound and complete with respect to the class of extremally disconnected spaces and we compare our approach to a different topological setting in which belief is interpreted in terms of the derived set operator. We also study belief revision as well as belief dynamics by providing a topological semantics for conditional belief and belief update modalities, respectively. Our setting based on extremally disconnected spaces, however, encounters problems when extended with dynamic updates. We then propose a solution consisting in interpreting belief in a similar way based on hereditarily extremally disconnected spaces, and axiomatize the belief logic of hereditarily extremally disconnected spaces. Finally, we provide a complete axiomatization of the logic of conditional belief and knowledge, as well as a complete axiomatization of the corresponding dynamic logic. (shrink)

definitions and explanations frequently come together and permeate almost all fields of knowledge. This does not exclude mathematics, even when these definitions hold clear links and close connections with our physical world. Here we propose a rather different perspective. Making operational physical assumptions, we show how it is possible to rigorously reconstruct some features of both geometry and topology. Broadly speaking, assuming this operational and more concrete philosophy we not only are capable of defining primitive concepts like points, straight lines, (...) planes, angles and spaces, but we also go all the way up to more complex constructions. We show that within our method it is also possible to come up with what we call a compass-based topology as well as a normed and a metric space. We hope this operationalist point-of-view can assist other researchers and students to have a clearer understanding of these quite abstract concepts. (shrink)

Possibility and reference have been central topics in metaphysics and the philosophy of language in the past decades. Wolfgang Freitag’s Form and Philosophy provides a novel approach to these notions and their interrelations, based on the concept of form as the key modal concept: form is the possibility space of objects. In its historic dimension, the book analyses the role of form in Ludwig Wittgenstein’s Tractatus Logico-Philosophicus and Immanuel Kant’s Critique of Pure Reason. In its systematic dimension, the book (...) offers an alternative ontological basis to David Armstrong’s combinatorial theory of possibility and rejects David Lewis’ analysis of possibility in terms of possible worlds. Representation is shown to rest on the idea of direct reference as proposed by David Kaplan and Saul Kripke. It is argued that the problem of reference links up with Wittgenstein’s rule-following problem, the nature of which is extensively discussed. It emerges that form and reference are complementary with respect to the notion of representation. Once their individual roles are seen, many metaphysical puzzles appear in a new light or disappear altogether. (shrink)

We show that none of the following statements is provable in Zermelo-Fraenkel set theory (ZF) answering the corresponding open questions from Brunner in ``The axiom of choice in topology'':(i) For every T2 topological space (X, T) if X is well-ordered, then X has a well-ordered base,(ii) For every T2 topological space (X, T), if X is well-ordered, then there exists a function f : X × W T such that W is a well-ordered set and (...) f ({x} × W) is a neighborhood base at x for each x X,(iii) For every T2 topological space (X, T), if X has a well-ordered dense subset, then there exists a function f : X × W T such that W is a well-ordered set and {x} = f ({x} × W) for each x X. (shrink)

We prove a topological completeness theorem for the modal logic $$\textsf{GLP}$$ GLP containing operators $$\{\langle \xi \rangle :\xi \in \textsf{Ord}\}$$ { ⟨ ξ ⟩ : ξ ∈ Ord } intended to capture a wellordered sequence of consistency operators increasing in strength. More specifically, we prove that, given a tall-enough scattered space X, any sentence $$\phi $$ ϕ consistent with $$\textsf{GLP}$$ GLP can be satisfied on a polytopological space based on finitely many Icard topologies constructed over X and (...) corresponding to the finitely many modalities that occur in $$\phi $$ ϕ. (shrink)

Dynamic topological logic is a multi-modal logic that was introduced for reasoning about dynamic topological systems, i.e. structures of the form $\langle{\mathfrak{X}, f}\rangle $, where $\mathfrak{X}$ is a topological space and $f$ is a continuous function on it. The problem of finding a complete and natural axiomatization for this logic in the original tri-modal language has been open for more than one decade. In this paper, we give a natural axiomatization of $\textsf{DTL}$ and prove its strong (...) completeness with respect to the class of all dynamic topological systems. Our proof system is infinitary in the sense that it contains an infinitary derivation rule with countably many premises and one conclusion. It should be remarked that $\textsf{DTL}$ is semantically non-compact, so no finitary proof system for this logic could be strongly complete. Moreover, we provide an infinitary axiomatic system for the logic ${\textsf{DTL}}_{\mathcal{A}}$, i.e. the $\textsf{DTL}$ of Alexandrov spaces, and show that it is strongly complete with respect to the class of all dynamical systems based on Alexandrov spaces. (shrink)

This paper presents a general computational treatment of how mammals are able to deal with visual objects and environments. The model tries to cover the entire range from behavior and phenomenological experience to detailed neural encodings in crude but computationally plausible reductive steps. The problems addressed include perceptual constancies, eye movements and the stable visual world, object descriptions, perceptual generalizations, and the representation of extrapersonal space.The entire development is based on an action-oriented notion of perception. The observer is assumed (...) to be continuously sampling the ambient light for information of current value. The central problem of vision is taken to be categorizing and locating objects in the environment. The critical step in this process is the linking of visual information to symbolic object descriptions; this is calledindexing, from the analogy of identifying a book from index terms. The system must also identifysituationsand use this knowledge to guide movement and other actions in the environment. The treatment focuses on the different representations of information used in the visual system.The four representational frames capture information in the following forms: retinotopic, head-based, symbolic, and allocentric. The functional roles of the four frames, the communication among them, and their suggested neurophysiological realization constitute the core of the paper. The model is perforce crude, but appears to be consistent with all relevant findings. (shrink)

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

We construct a collection of new topological Ramsey spaces of trees. It is based on the Halpern-Läuchli theorem, but different from the Milliken space of strong subtrees. We give an example of its application by proving a partition theorem for profinite graphs.

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)

The purpose of this paper is to introduce and study the characteristic function of a neutrosophic set. After given the fundamental definitions of neutrosophic set operations generated by the characteristic function of a neutrosophic set ( Ng for short), we obtain several properties, and discussed the relationship between neutrosophic sets generated by Ng and others. Finally, we introduce the neutrosophic topological spaces generated by Ng . Possible application to GIS topology rules are touched upon.

This paper is a continuation of [VAK 01]. The notion of local connection algebra, based on the primitive notions of connection and boundedness, is introduced. It is slightly different but equivalent to Roeper's notion of region-based topology [ROE 97]. The similarity between the local proximity spaces of Leader [LEA 67] and local connection algebras is emphasized. Machinery, analogous to that introduced by Efremovi?c [EFR 51],[EFR 52], Smirnov [SMI 52] and Leader [LEA 67] for proximity and local proximity spaces, is developed. (...) This permits us to give new proximity-type models of local connection algebras, to obtain a representation theorem for such algebras and to give a new shorter proof of the main theorem of Roeper's paper [ROE 97]. Finally, the notion of MVD-algebra is introduced. It is similar to Mormann's notion of enriched Boolean algebra [MOR 98], based on a single mereological relation of interior parthood. It is shown that MVD-algebras are equivalent to local connection algebras. This means that the connection relation and boundedness can be incorporated into one, mereological in nature relation. In this way a formalization of the Whiteheadian theory of space based on a single mereological relation is obtained. (shrink)

Let T be the family of open subsets of a topological space . We prove that if T has a base of cardinality μ, λμ<2λ, λ strong limit of cofinality 0, then T has cardinality μ or 2λ. This is our main conclusion . In Theorem 2 we prove it under some set-theoretic assumption, which is clear when λ = μ; then we eliminate the assumption by a theorem on pcf from [Sh 460] motivated originally by this. (...) Next we prove that the simplest examples are the basic ones; they occur in every example . The main result for the case λ = 0 was proved in [Sh 454]. (shrink)

In this paper, we generalize the crisp topological spaces to the notion of neutrosophic crisp topological space, and we construct the basic concepts of the neutrosophic crisp topology.

This paper describes the topological aspect of a logic-based, artificial intelligence approach to formalising the qualitative description of spatial properties and relations, and reasoning about those properties and relations. This approach, known as RCC theory, has been under development for several years at the University of Leeds. The main rationale for this project is that qualitative descriptions of spatial properties and relationships, and qualitative spatial reasoning, are of fundamental importance in human thinking about the world: even where quantitative spatial (...) data are most important, they must be attached to the components of a perceived spatial structure if we are to make use of them. RCC theory covers other qualitative aspects of spatial description and reasoning, but the topological properties and relations of spatially extended entities are fundamental to our work. The topological formalisms used by mathematicians are, in general, not well suited to the task of formalising the kinds of ‘common-sense’ or ‘everyday’ qualitative spatial description and reasoning which are our primary interest. Nevertheless, we must come to grips with the concepts of topology as practised by mathematicians if we are not to risk constantly ‘reinventing wheels’. (shrink)

In the poetics of Gaston Bachelard, the natural images, especially the four elements (fire, water, air, earth), occupy the eminent place for literary imagination. Under this main frame, this paper tries to present the relation of ethics and aesthetics in focusing on the ethical image as a synthetic concept. It also argues that the poetic imagination in Bachelard presupposes a metaphysical base managing the being, the force, the will, and the action. There is a dynamic structure in this metaphysics (...) of imagination. Notwithstanding the usual separation of different spheres in philosophy, Bachelard urges a primary fusion in the cosmic scale, i.e.the world and the human are communicative and correspondent. Taking these principles into consideration, this paper explores the topological dimension in those poetic images of elements and space. The ontological sense of being-there is evaluated by the dynamic function of “there” in restoring its ethical meaning. Likewise, the terms “in front of the fire”, “before the water”, “in the water” are given the topological accents. The verticality indicating the dynamic function of the flight, of the falling, and of standing upright is topologically effective. In accordance to the verticality, the concept of survival contains an effect of surpassing the existential conditions, the prefix “sur-“ means that tentative of the higher degree. In sum, the cosmicity as the very place of ethical and ontological unificationreveals Bachelard’s concern on the imaginative transformation of the personality, the appropriation in the cosmos. (shrink)

Effective inseparability of pairs of sets is an important notion in logic and computer science. We study the effective inseparability of sets which appear as index sets of subsets of an effectively given topological T0-space and discuss its consequences. It is shown that for two disjoint subsets X and Y of the space one can effectively find a witness that the index set of X cannot be separated from the index set of Y by a recursively enumerable (...) set, if X intersects the topological closure of an effectively enumerable subset of Y. As a consequence of a more general parametric inseparability result a theorem of Rice-Shapiro type is obtained. Moreover, under some additional requirements it follows that nonopen subsets have productive index sets. This implies a generalized Rice theorem: Connected spaces have only trivial completely recursive subsets. As application some decision problems in computable analysis and domain theory are studied. It follows that the complement of the halting problem can be reduced to the problem to decide of a number whether it is a computable irrational. The same is true for the problems to decide whether two numbers are equal, whether one is not greater than the other, and whether a number is equal to a given number. In the case of an effectively given continuous complete partial order the complexity of the last problem depends on whether the given element is the smallest element, in which case the complement of the halting problem is reducible to it, whether it is a base element and maximal, then the decision problem is recursively isomorphic to the halting problem, or whether it is none of these. In this case, both the halting problem and its complement are reducible to the problem. The same is true in nontrivial cases for the problems whether an element belongs to the basis, whether two elements of the partial order are equal, or whether one approximates the other. In general, for any nonempty proper subset of the partial order either the halting problem or its complement can be reduced to the membership problem of the subset. (shrink)

The author has recently shown that a mathematical question regarding the fundamental constituents of hardrons cannot be resolved unless the classical axioms of nonfinite mathematics are revised in such a way as to produce a new theory of particle motion in continuous space-time. Under this new theory, the instantaneous position of a moving object has a magnitude that is increasing as the object's velocity. The purpose of this paper is to show that, quite apart from the question of Cantorian (...) axiomatics, the new theory of motion is more consistent with what physicists really believe than the traditional theory of motion. (shrink)

This paper argues that professionals who make boundary-related decisions should be guided by relationship-based practice. In our roles as service users and professionals, drawing from our lived experiences of professional relationships, we argue we need to move away from distance-based practice. This includes understanding the boundary stories and narratives that exist for all of us – including the people we support, other professionals, as well as the organisations and systems within which we work. When we are dealing with professional boundary (...) issues, we should centre relationship-building skills that are central to many other aspects of our work. Skills that foster relationships at all levels – between professionals, service users, and services – need to be revalued. Our final recommendation is to create, develop, and foster safer spaces within and outside of organisations, as well as inter-professionally, for the discussion and exploration of boundary-related issues and practice. We are interested in hearing from those with experiences of being marginalised by boundaries so that they can inform a reshaping of our collective ideas around boundary related practices. To foster relationship-based practices in organisations, we have outlined several recommendations here; however, we recognize that these do not go far enough, and that collective action is needed to inform systemic change. (shrink)

We consider semi‐algebraic sets and properties of these sets that are expressible by sentences in first‐order logic over the reals. We are interested in first‐order properties that are invariant under topological transformations of the ambient space. Two semi‐algebraic sets are called topologically elementarily equivalent if they cannot be distinguished by such topological first‐order sentences. So far, only semi‐algebraic sets in one and two‐dimensional space have been considered in this context. Our contribution is a natural characterisation of (...) topological elementary equivalence of regular closed semi‐algebraic sets in three‐dimensional space, extending a known characterisation for the two‐dimensional case. Our characterisation is based on the local topological behaviour of semi‐algebraic sets and the key observation that topologically elementarily equivalent sets can be transformed into each other by means of geometric transformations, each of them mapping a set to a first‐order indistinguishable one. (shrink)

We explore a non-classical, universal set theory, based on a purely 'structural' conception of sets. A set is a transfinite process of unfolding of an arbitrary binary structure, with identity of sets given by the observational equivalence between such processes. We formalize these notions using infinitary modal logic, which provides partial descriptions for set structures up to observational equivalence. We describe the comprehension and topological properties of the resulting set-theory, and we use it to give non-classical solutions to classical (...) paradoxes, to prove fixed-point theorems that relate recursion and corecursion, to formalize 'super-large', reflexive categories and 'super-large' circular modes, and to provide 'natural' solutions for domain equations. (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 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.

Since the world is full of indeterminacy, the Neutrosophics found their place into contemporary research. We now introduce for the first time the notions of Neutrosophic Crisp Sets and Neutrosophic Topology on Crisp Sets. We develop the 2012 notion of Neutrosophic Topological Spaces and give many practical examples. Neutrosophic Science means development and applications of Neutrosophic Logic, Set, Measure, Integral, Probability etc., and their applications in any field. It is possible to define the neutrosophic measure and consequently the neutrosophic (...) integral and neutrosophic probability in many ways, because there are various types of indeterminacies, depending on the problem we need to solve. Indeterminacy is different from randomness. Indeterminacy can be caused by physical space, materials and type of construction, by items involved in the space, or by other factors. In 1965 [51], Zadeh generalized the concept of crisp set by introducing the concept of fuzzy set, corresponding to the situation in which there is no precisely defined set;there are increasing applications in various fields, including probability, artificial intelligence, control systems, biology and economics. Thus, developments in abstract mathematics using the idea of fuzzy sets possess sound footing. In accordance, fuzzy topological spaces were introduced by Chang [12] and Lowen [33]. After the development of fuzzy sets, much attention has been paid to the generalization of basic concepts of classical topology to fuzzy sets and accordingly developing a theory of fuzzy topology [1-58]. In 1983, the intuitionistic fuzzy set was introduced by K. Atanassov [55, 56, 57] as a generalization of the fuzzy set, beyond the degree of membership and the degree of non-membership of each element. In 1999 and 2002, Smarandache [71, 72, 73, 74] defined the notion of Neutrosophic Sets, which is a generalization of Zadeh’s fuzzy set and Atanassov's intuitionistic fuzzy set. Some neutrosophic concepts have been investigated by Salama et al. [61-70]. Forwarding the study of neutrosophic sets, this book consists of seven chapters, targeting to:  generalize the previous studies in [1-59], and[91-94] so to define the neutrosopic crisp set and neutrosophic set concepts;  discuss their main properties; A. A. Salama & Florentin Smarandache  introduce and study some concepts of neutrosophic crisp and neutrosophic topological spaces and deduce their properties;  deduce many types of functions and give the relationships between different neutrosophic topological spaces, which helps to build new properties of neutrosophic topological spaces;  stress once more the importance of Neutrosophic Ideal as a nontrivial extension of neutrosophic set and neutrosophic logic [71, 72, 73, 74];  propose applications on computer sciences by using neutrosophic sets. (shrink)

The paper introduces a concept of a ‘negotiated space’ to describe university researchers’ attempts to balance pragmatically, continually and dynamically over time, their own agency and autonomy in the selection of research topics and pursuit of scientific research to filter out the explicit steering and tacit signals of external research funding agencies and university strategies and policies. We develop this concept to explore the degree of autonomy researchers in fact have in this process and draw on semi-structured interview material (...) with research group leaders in Finland and the UK, in the former in seven research fields, in the latter in two fields. First, the analysis reveals that topic selection is strongly filtered by the intra-scientific factors. In topic selection researchers have more leeway, a broader negotiated space than in research content, that is, in the ways in which they pursue their research, which are more affected by funding opportunities and other contextual matters. Second, the ways which affect researchers’ agency include individual- and more aggregate-level acts and factors: at the individual level, researchers resort to different strategies to create a negotiated space, but at the more aggregate level field-specific factors play a role. In fields with multiple funding opportunities, which we call ‘shopping mall’ fields, researchers can have a broader negotiated space than in fields where funding is more based on ‘lottery’. In the latter, the researchers’ negotiated space is narrow and contingent on the outcome of the funders’ decisions. (shrink)

In typical statistical learning studies, researchers define sequences in terms of the probability of the next item in the sequence given the current item (or items), and they show that high probability sequences are treated as more familiar than low probability sequences. Existing accounts of these phenomena all assume that participants represent statistical regularities more or less as they are defined by the experimenters—as sequential probabilities of symbols in a string. Here we offer an alternative, or possibly supplementary, hypothesis. Specifically, (...) rather than identifying or labeling individual stimuli discretely in order to predict the next item in a sequence, we need only assume that the participant is able to represent the stimuli as evincing particular similarity relations to one another, with sequences represented as trajectories through this similarity space. We present experiments in which this hypothesis makes sharply different predictions from hypotheses based on the assumption that sequences are learned over discrete, labeled stimuli. We also present a series of simulation models that encode stimuli as positions in a continuous two‐dimensional space, and predict the next location from the current location. Although no model captures all of the data presented here, the results of three critical experiments are more consistent with the view that participants represent trajectories through similarity space rather than sequences of discrete labels under particular conditions. (shrink)

In this paper, we purposed further study on rough functions and introduced some concepts based on it. We introduced and investigated the concepts of topological lower and upper approximations of near-open sets and studied their basic properties. We defined and studied new topological neighborhood approach of rough functions. We generalized rough functions to topological rough continuous functions by different topological structures. In addition, topological approximations of a function as a relation were defined and studied. Finally, (...) we applied our approach of rough functions in finding the images of patient classification data using rough continuous functions. (shrink)

A topological description of space is given, based on the relation of connection among regions and the property of being limited. A minimal set of 10 constraints is shown to permit definitions of points and of open and closed sets of points and to be characteristic of locally compact T2 spaces. The effect of adding further constraints is investigated, especially those that characterise continua. Finally, the properties of mappings in region-based topology are studied. Not all such mappings correspond (...) to point functions and those that do correspond to continuous functions. (shrink)

The law of gravitational attraction is a window on three formal approaches to laws of nature based on Lorentz-invariance: Poincaré’s four-dimensional vector space (1906), Minkowski’s matrix calculus and spacetime geometry (1908), and Sommerfeld’s 4-vector algebra (1910). In virtue of a common appeal to 4-vectors for the characterization of gravitational attraction, these three contributions track the emergence and early development of four-dimensional physics.

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)

There are many network topology designs that have emerged to fulfill the growing need for networks to provide a robust platform for a wide range of applications like running businesses and managing emergencies. Amongst the most famous network topology designs are star network, mesh network, hexagonal network, honeycomb network, etc. In a star network, a central computer is linked with various terminals and other computers over point-to-point lines. The other computers and terminals are directly connected to the central computer but (...) not to one another. As such, any failure in the central computer will result in a failure of the entire network and computers in star network will not be able to communicate. The star topology design can be represented by a graph where vertices represent the computer nodes and edges represent the links between the computer nodes. In this paper, we study the vertex-edge-based topological descriptor for a newly designed hexagon star network. (shrink)

The bases of tenets of the World came from the East; Pythagoras learnt all there up the 26 years. At a home, the east ideas where took in no; then he bound the mathematics with the elements of matter. This was the best way to a blood feud of the all Humanity. The 17th age gave the bases of mathematics and the Greek atomism; this had led to the paranoia in all sciences. The LCE was brought in 19th age with (...) bases no; really it was the box of Pandora in the form of wrong sciences of the Nature. The wise revenge of Pythagoras was in the form of riddle for the best thinkers in the World in all times; us solved one in the 50th years. A base of the World is of the material space (MS) with praatoms (PAs) Ao; they are of the affinity to matter. A density of the MS is of ~ 5.10‐6 kg/m3 close to the Ears. PA Ao is of quant of matter and antimatter; they are of rotate in the different sides. All matter takes up Ao and to grow. In the giant stars to go the bursts giving Ao, or caloric. The matter of being in the World on base of the key law of conservation of heat (caloric) and matter by loss of energy; it is main. Leibniz offered to the conservation of mv2 in the World. But Newton knew that any move is damped, and it need in filled up. This the author proved by tests over the 300 years just. D.Bernoulli given to the model of gas. I. Kant proved that mv2 is the quantity of heat by stop of the body; it is no the energy! A key leitmotiv of thought is blocked the grasp of facts if ones not leaded to an accepted concept. P. Mayer had the blunder in base of the LCE; a work of gas expansion in Torricelli tube is equal nil strong! This is the gross blunder of a sick paranoiac! The 21 age gave up a new philosophy and a way to endless engine. The super skills from ideal quartz with moving jaws to respond to the all new philosophy and sciences. (shrink)

In this paper we introduce the notion of ideals on neutrosophic set which is considered as a generalization of fuzzy and fuzzy intuitionistic ideals studies in [9,11] , the important topological neutrosophic ideals has been given in [4]. The concept of neutrosophic local function is also introduced for a neutrosophic topological space. These concepts are discussed with a view to fiind new neutrosophic topology from the original one in [8]. The basic structure, especially a basis for such (...) generated neutrosophic topologies and several relations between different topological neutrosophic ideals and neutrosophic topologies are also studied here. Possible application to GIS topology rules are touched upon. -/- . (shrink)

Discipleship is a responsibility of the Church. It is an outlet in which the regeneration of Church leadership to the younger generation is conducted. Before the COVID-19 pandemic, discipleship and mentoring of youth leaders, especially key persons of GKII (Gereja Kemah Injil Indonesia) youth were provided by means of in-person activities. During the pandemic, digital media has been utilised for various church activities, including mentoring these key persons. Hence, this research intends to explore: (1) the method by which key persons (...) practise digital discipleship and (2) the benefits of digital media in youth discipleship to facilitate faith growth. This research is a qualitative research. Data were collected by means of interviews and observations on several key persons’ digital media accounts. The research shows that social media significantly benefits the discipleship process. It was found that digital discipleship was quite often carried out during the pandemic, especially in urban areas, with WhatsApp and Zoom meetings as its two primary means. However, it slightly declined along with the lifting of social gathering restrictions. The main themes explored in the mentoring sessions were discipleship, soteriology, spiritual life, motivational and digital media materials, and youth ministry in the digital era. The discipleship practice used was the NM-SM (Nurtured, Matured, Served, Mission) pattern.Contribution: The results of this research contribute to the development of knowledge, especially in the field of youth discipleship, and digital media-based discipleship. This research also shows that digital media has become an effective theological space during the pandemic and post-pandemic periods. (shrink)