In this paper, we presented antoher concept of neutrosophic open sets called neutrosophic semi-α-open sets and studied their fundamental poperties in neutrosophic topological spaces. We also present neutrospohic semi-α-interior and neutrosophic semi-α-closure and study some of their fundamental properties.

The neutrosophic sets were known since 1999, and because of their wide applications and their great flexibility to solve the problems, we used these the concepts to define a new types of neutrosophic crisp closed sets and limit points in neutrosophic crisp topological space, namly [neutrosophic crisp Gem sets and neutrosophic crisp Turig points] respactvely, we stady their properties in details and join it with topological concepts. Finally we used [neutrosophic (...) crisp Gem sets and neutrosophic crisp Turig points] to introduce of topological concepts as: neutrosophic crisp closed (open) sets, neutrosophic crisp closure, neutrosophic crisp interior, neutrosophic crisp extrior and neutrosophic crisp boundary which are fundamental for further reserch on neutrosophic crisp topology and will setrengthen the foundations of theory of neutrosophic topological spaces. (shrink)

In this paper, we introduce and investigate a new class of sets and functions between topological space called neutrosophic semi-supra open set and neutrosophic semi-supra open continuous functions respectively.

In this paper, we introduce and study the concept of" neutrosophic closed set" and" neutrosophic continuous function". Possible application to GIS topology rules are touched upon.

We investigate topological properties of subsets S of the real plane, expressed by first-order logic sentences in the language of the reals augmented with a binary relation symbol for S. Two sets are called topologically elementary equivalent if they have the same such first-order topological properties. The contribution of this paper is a natural and effective characterization of topological elementary equivalence of closed semi-algebraic sets.

We investigate topological properties of subsets S of the real plane, expressed by first-order logic sentences in the language of the reals augmented with a binary relation symbol for S. Two sets are called topologically elementary equivalent if they have the same such first-order topological properties. The contribution of this paper is a natural and effective characterization of topological elementary equivalence of closed semi-algebraic sets.

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 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)

Let p be prime number, K be a p‐adically closed field, a semi‐algebraic set defined over K and the lattice of semi‐algebraic subsets of X which are closed in X. We prove that the complete theory of eliminates quantifiers in a certain language, the ‐structure on being an extension by definition of the lattice structure. Moreover it is decidable, contrary to what happens over a real closed field for. We classify these ‐structures up to elementary (...) equivalence, and get in particular that the complete theory of only depends on m, not on K nor even on p. As an application we obtain a classification of semi‐algebraic sets over countable p‐adically closed fields up to so‐called “pre‐algebraic” homeomorphisms. (shrink)

Background Voluntary assisted dying became lawful in Victoria, the first Australian state to permit this practice, in 2019 via the Voluntary Assisted Dying Act 2017 (Vic). While conscientious objection by individual health professionals is protected by the Victorian legislation, objections by institutions are governed by policy. No research has been conducted in Victoria, and very little research conducted internationally, on how institutional objection is experienced by patients seeking assisted dying. Methods 28 semi-structured interviews were conducted with 32 family caregivers (...) and one patient about the experience of 28 patients who sought assisted dying. Participants were interviewed during August-November 2021. Data from the 17 interviews (all with family caregivers) which reported institutional objection were analysed thematically. Results Participants reported institutional objection affecting eligibility assessments, medication access, and taking the medication or having it administered. Institutional objection occurred across health settings and was sometimes communicated obliquely. These objections resulted in delays, transfers, and choices between progressing an assisted dying application and receiving palliative or other care. Participants also reported objections causing adverse emotional experiences and distrust of objecting institutions. Six mediating influences on institutional objections were identified: staff views within objecting institutions; support of external medical practitioners and pharmacists providing assisted dying services; nature of a patient’s illness; progression or state of a patient’s illness; patient’s geographical location; and the capability and assertiveness of a patient and/or caregiver. Conclusions Institutional objection to assisted dying is much-debated yet empirically understudied. This research found that in Victoria, objections were regularly reported by participants and adversely affected access to assisted dying and the wider end-of-life experience for patients and caregivers. This barrier arises in an assisted dying system that is already procedurally challenging, particularly given the limited window patients have to apply. Better regulation may be needed as Victoria’s existing policy approach appears to preference institutional positions over patient’s choice given existing power dynamics. (shrink)

Neutrosophic set is a new mathematical tool for handling problems involving imprecise, indetermi nacy and inconsistent data. Pseudo-BCI algebra is a kind of non-classical logic algebra in close connection with various non-commutative fuzzy logics. Recently, we applied neutrosophic set theory to pseudo-BCI al gebras. In this paper, we study neutrosophic filters in pseudo-BCI algebras. The concepts of neutrosophic regular filter, neutrosophic closed filter and fuzzy regular filter in pseudo-BCI algebras are introduced, and some basic (...) properties are discussed. Moreover, the relationships among neutrosophic regular filter, fuzzy filters and anti-grouped neutrosophic filters are prese nted, and the results are proved: a neutrosophic filter (fuzzy filter) is a neutrosophic regular filter (fuzzy regular filter), if and only if it is both a neutrosophic closed filter (fuzzy closed filter) and an anti-grouped neutrosophic filter (fuzzy anti-grouped filter). (shrink)

In this paper, multi attribute decision making problem based on grey relational analysis in neutrosophic cubic set environment is investigated. In the decision making situation, the attribute weights are considered as single valued neutrosophic sets. The neutrosophic weights are converted into crisp weights. Both positve and negative GRA coefficients, and weighted GRA coefficients are determined. Hamming distances for weighted GRA coefficients and standard (ideal) GRA coefficients are determined. The relative closeness coefficients are derived in order to (...) rank the alternatives. The relative closeness coefficients are designed in ascending order. Finally, a numerical example is solved to demonstrate the applicability of the proposed approach. (shrink)

Product acceptance determination using similarity measure index by neutrosophic statistics / Muhammad Aslam and Rehan Ahmed Khan Sherwani -- New concepts of strongly edge irregular interval-valued neutrosophic graphs / A.A.Talebi, Hossein Rashmanlou and Masoomeh Ghasemi -- The link between neutrosophy and learning : through the related concepts of representation and compression / Philippe Schweizer -- Neutrosophic soft cubic M-subalgebras of B-algebras / Mohsin Khalid, Neha Andaleeb Khalid and Hasan Khalid -- Alpha, beta and gamma product of (...) class='Hi'>neutrosophic graphs / Nasir Shah, Said Broumi, Abdul Raheem and Tahir Imran -- Neutrosophic cubic normal ideal and neutrosophic cubic closed normal ideal of PS-algebra / Mohsin Khalid, Hasan khalid and Neha Andaleeb Khalid -- Neutrosophic multisets : an overview / Vakkas Uluçay -- Neutrosophy as a model for knowledge : the influence of representative models on thinking / Philippe Schweizer -- When neutrosophic theory meets three-way decisions / Rui Ren, Chao Zhang and Deyu Li -- Neutrosophic economic order quantity model with more than one price breaks / R. Surya, M. Mullai and G. Madhan Kumar -- General non-square systems of linear equations in single-valued triangular neutrosophic number environment / S.A. Edalatpanah -- Hesitant neutrosophic soft set relations / Abhijit Saha -- Computer application of neutrosophic set operations / S. Saranya, M. Vigneshwaran, Said Broumi -- Triangular bipolar neutrosophic based transportation problem / Avishek Chakraborty -- Studying neutrosophic variables / Rafif Alhabib and Ahmad Salama -- Decision making for logistics center location selection in trapezoidal neutrosophic environment / Kalyan Mondal and Surapati Pramanik -- Weighted similarity measure and decision making model for clinical application of single valued neutrosophic set / R.Binu and P. Isaac -- Rough neutrosophic set : an overview / Surapati Pramanik -- Some new concepts on normalized SVTN-number and multiple criteria decision making / İrfan Deli and Emel Kırmızı Öztürk. (shrink)

The objective of this study is to incorporate topological space into the realm of n-Cylindrical Fuzzy Neutrosophic Sets (n-CyFNS), which are the most novel type of fuzzy neutrosophic sets. In this paper, we introduce n-Cylindrical Fuzzy Neutrosophic Topological Spaces (n-CyFNTS), n-Cylindrical Fuzzy Neutrosophic (n-CyFN) open sets, and n-CyFN closed sets. We also defined the n-CyFN base, n-CyFN subbase, and some related theorems here.

In the fifth version of our response-paper [26] to Imamura’s criticism, we recall that NonStandard Neutrosophic Logic was never used by neutrosophic community in no application, that the quarter of century old neutrosophic operators (1995-1998) criticized by Imamura were never utilized since they were improved shortly after but he omits to tell their development, and that in real world applications we need to convert/approximate the NonStandard Analysis hyperreals, monads and binads to tiny intervals with the desired accuracy (...) – otherwise they would be inapplicable. We point out several errors and false statements by Imamura [21] with respect to the inf/sup of nonstandard subsets, also Imamura’s “rigorous definition of neutrosophic logic” is wrong and the same for his definition of nonstandard unit interval, and we prove that there is not a total order on the set of hyperreals (because of the newly introduced Neutrosophic Hyperreals that are indeterminate), whence the Transfer Principle from R to R* is questionable. After his criticism, several response publications on theoretical nonstandard neutrosophics followed in the period 2018-2022. As such, I extended the NonStandard Analysis by adding the left monad closed to the right, right monad closed to the left, pierced binad (we introduced in 1998), and unpierced binad - all these in order to close the newly extended nonstandard space (R*) under nonstandard addition, nonstandard subtraction, nonstandard multiplication, nonstandard division, and nonstandard power operations [23, 24]. Improved definitions of NonStandard Unit Interval and NonStandard Neutrosophic Logic, together with NonStandard Neutrosophic Operators are presented. (shrink)

The science of operations research is one of the modern sciences that have made a great revolution in all areas of life through the methods provided by it, suitable and appropriate to solve most of the problems that were facing researchers, scholars and those interested in the development of societies, and the most beneficiaries of this science were companies and institutions that are looking for scientific methods that help them manage their work so that they achieve the greatest profit and (...) the lowest cost, and one of the important methods that have been used in the management of companies we offer in this research two methods, Dynamic programming method. This method has been used in many practical matters and helped decision-makers in companies to achieve a maximum profit and less cost by formulating the reality of the state of the company and the data provided by decision-makers with a dynamic mathematical model that is solved using methods of solving dynamic models and we will provide in this research an example of this through the issue of choosing the optimal investment for the budget of a company so that it achieves a maximum profit, and the method of programming with integers: the method that provided these companies with solutions with integer values suitable for the nature of its work, through the use of the binary integer in the formulation of the appropriate mathematical model on the one hand, and on the other hand, the use of the binary integer variable helped to convert some nonlinear models that lead to some practical problems into linear models, and it should be noted here that in the previous two methods there is something indeterminable because we must make a decision in choosing or not choosing something, but the optimal solution that we will get remains A specific value because we are building the mathematical model for any realistic issue through the data provided by those responsible for the work and these data are calculated quantities and therefore they are uncertain values because their validity depends on the circumstances surrounding the work environment, they may be exposed to increase or decrease, and therefore the optimal solution on which the company will base its decision is suitable for specific values and any change in them can cause the company an uncalculated loss, so in this research we will use the concepts of neutrosophic science, the branch of science founded by the American scientist Florentin Smarandache in 1995 based on his belief that there is no absolute truth, a science that is interested in the study of ideas and concepts that are neither true nor false, but just in between, and we will take the data (calculated quantities) neutrosophic values that are specified or unspecified values are any set close to the calculated quantities, then the resulting mathematical model is a neutrosophic model and the optimal solution has neutrosophic values and thanks to the indefinite uncertainty that these values have, companies from the development of appropriate plans for all circumstances and thus achieve the greatest profit and the lowest cost, and we will clarify the above through two issues, the issue of optimal designation of a warehouse site, which we will formulate the mathematical model of using the neutrosophic integer programming method - and the issue of capital budget, which we will present in two different forms, we use in the first form the neutrosophic integer programming method and in the second the neutrosophic dynamic programming method. (shrink)

In this paper, semi-Post algebras are introduced and investigated. The generalized Post algebras are subcases of semi-Post algebras. The so called primitive Post constants constitute an arbitrary partially ordered set, not necessarily connected as in the case of the generalized Post algebras examined in [3]. By this generalization, semi-Post products can be defined. It is also shown that the class of all semi-Post algebras is closed under these products and that every semi-Post algebra is (...) a semi-Post product of some generalized Post algebras. (shrink)

In this paper, I develop a view on set-theoretic ontology I call Universe-Indeterminism, according to which there is a unique but indeterminate universe of sets. I argue that Solomon Feferman’s work on semi-constructive set theories can be adapted to this project, and develop a philosophical motivation for a semi-constructive set theory closely based on Feferman’s but tailored to the Universe-Indeterminist’s viewpoint. I also compare the emergent Universe-Indeterminist view to some more familiar views on set-theoretic ontology.

Let and T be a set‐valued map from E to. We prove that if T is p‐adic semi‐algebraic, lower semi‐continuous and is closed for every, then T has a p‐adic semi‐algebraic continuous selection. In addition, we include three applications of this result. The first one is related to Fefferman's and Kollár's question on existence of p‐adic semi‐algebraic continuous solution of linear equations with polynomial coefficients. The second one is about the existence of p‐adic semi‐algebraic (...) continuous extensions of continuous functions. The other application is on the characterization of right invertible p‐adic semi‐algebraic continuous functions under the composition. (shrink)

We introduce the Causal Compatibility Conjecture for the Events, Trees, Histories approach to Quantum Theory in the semi-classical setting. We then prove that under the assumptions of the conjecture, points on closed causal curves are physically indistinguishable in the context of the ETH approach to QT and thus the conjecture implies a compatibility of the causal structures even in presence of closed causal curves. As a consequence of this result there is no observation that could be made (...) by an observer to tell any two points on a closed causal curve apart. We thus conclude that closed causal curves have no physical significance in the context of the ETH approach to QT. This is an indication that time travel will not be possible in a full quantum theory of gravity and thus forever remain a fantasy. (shrink)

The interval neutrosophic uncertain linguistic variables can easily express the indeterminate and inconsistent information in real world, and TOPSIS is a very effective decision making method more and more extensive applications. In this paper, we will extend the TOPSIS method to deal with the interval neutrosophic uncertain linguistic information, and propose an extended TOPSIS method to solve the multiple attribute decision making problems in which the attribute value takes the form of the interval neutrosophic uncertain linguistic variables (...) and attribute weight is unknown. Firstly, the operational rules and properties for the interval neutrosophic variables are introduced. Then the distance between two interval neutrosophic uncertain linguistic variables is proposed and the attribute weight is calculated by the maximizing deviation method, and the closeness coefficients to the ideal solution for each alternatives. Finally, an illustrative example is given to illustrate the decision making steps and the effectiveness of the proposed method. (shrink)

In the fifth version of our reply article [26] to Imamura's critique, we recall that Neutrosophic Non-Standard Logic was never used by the neutrosophic community in any application, that the quarter-century old (1995-1998) neutrosophic operators criticized by Imamura were never used as they were improved soon after, but omits to talk about their development, and that in real-world applications we need to convert/approximate the hyperreals, monads and bi-nads of Non-Standard Analysis to tiny intervals with the desired precision; (...) otherwise they would be inapplicable. We pointed out several errors and false statements by Imamura [21] regarding the inf/sup of nonstandard subsets, also Imamura's "rigorous definition of neutrosophic logic" is incorrect, as is his definition of nonstandard unit interval, and we showed that there is no total order in Neutrosophic Computing and Machine Learning , Vol. 23, 2022 Florentin Smarandache, Definición mejorada de la lógica neutrosófica no estándar e introducción a los hiperreales neutrosóficos (Quinta versión) 2 the set of hyperreals (due to the recently introduced Neutrosophic Hyperreals which are indeterminate), so the Transfer Principle from R to R* is questionable. After his critique, several reply posts on non-standard theoretical neutrosophy followed in 2018-2022. As such, I extended the Nonstandard Analysis by adding the right-closed left monad, the left-closed right monad, the punctured binad (which we introduced in 1998), and the nonpunctured binad - all in order to close the newly extended nonstandard space (R*) under nonstandard addition, nonstandard subtraction, nonstandard multiplication, nonstandard division, and nonstandard power operations [23, 24]. Improved definitions of the Nonstandard Unitary Interval and Nonstandard Neutrosophic Logic are presented, along with Nonstandard Neutrosophic Operators. (shrink)

In this paper, we consider reducts of p-adically closed fields. We introduce a notion of shadows: sets Mf={∈K2∣|y|=|f|}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${M_f = \{ \in K^2 \mid |y| = |f|\}}$$\end{document}, where f is a semi-algebraic function. Adding symbols for such sets to a reduct of the ring language, we obtain expansions of the semi-affine language where multiplication is nowhere definable, thus giving a negative answer to a question posed by Marker, (...) Peterzil and Pillay. The second main result of this paper is the fact that in p-adic fields, full multiplication becomes definable if we add a rational function to the semi-affine language. (shrink)

Ethical consumerism theory aims to describe, explain, and evaluate the ways in which producers and consumers use the market to support social and environmental values. The literature draws insights from empirical studies of sectors that largely take place on the legal market, such as textiles and agri-food. This paper takes a first step toward theorizing ethical consumerism in semi-legal sectors where market activities occur legally and illegally. How does extant theory extend to sectors such as sex work, cigarettes, and (...) recreational drugs? This study draws on the case of recreational cannabis (marijuana) in Portland, OR (USA). Data from 33 interviews, structured fieldwork at 64 dispensaries, and the US Census Bureau American Community Survey are analyzed using qualitative, quantitative, and spatial methods. The findings are compared to 12 suggestions that emerge from the literature on fair trade, organics, alternative agriculture, and political consumerism. I argue that not all ethical consumerism theory extends to semi-legal sectors. Cannabis closely resembles theoretical expectations in terms of supply/demand, prioritization of ethical issues, and pervasiveness of false claims, but differs in terms of who organizes, which types of strategies are pursued, and how ethical products are framed. The differences stem from several pervasive stigmas about cannabis. I also argue that the stigmas that set cannabis apart from other (more legal sectors) and present challenges to ethical consumerism in cannabis are directly related to the War on Drugs. These insights suggest that prohibition (and its lingering effects) can inhibit the emergence of ethical consumerism. (shrink)

Semi-hyperhypersimple c.e. sets, also known as diagonals, were introduced by Kummer. He showed that by considering an analogue of hyperhypersimplicity, one could characterize the sets which are the Halting problem relative to arbitrary computable numberings. One could also consider half of splittings of maximal or hyperhypersimple sets and get another variant of maximality and hyperhypersimplicity, which are closely related to the study of automorphisms of the c.e. sets. We investigate the Turing degrees of these classes (...) of c.e. sets. In particular, we show that the analogue of a theorem of Martin fails for these classes. (shrink)

We study a reduct ${\mathcal{L}_*}$ of the ring language where multiplication is restricted to a neighbourhood of zero. The language is chosen such that for p-adically closed fields K, the ${\mathcal{L}_*}$ -definable subsets of K coincide with the semi-algebraic subsets of K. Hence structures (K, ${\mathcal{L}_*}$ ) can be seen as the p-adic counterpart of the o-minimal structure of semibounded sets. We show that in this language, p-adically closed fields admit cell decomposition, using cells similar to (...) p-adic semi-algebraic cells. From this we can derive quantifier-elimination, and give a characterization of definable functions. In particular, we conclude that multiplication can only be defined on bounded sets, and we consider the existence of definable Skolem functions. (shrink)

We study the impact of a kind of non‐archimedean stratifications (t‐stratifications) on tangent cones of definable sets in real closed fields. We prove that such stratifications induce stratifications of the same nature on the tangent cone of a definable set at a fixed point. As a consequence, the archimedean counterpart of a t‐stratification is shown to induce Whitney stratifications on the tangent cones of a semi‐algebraic set. Extensions of these results are proposed for real closed fields (...) with further structure. (shrink)

It is known that the box dimension of any Martin-Löf random closed set of ${\{0,1\}^\mathbb{N}}$ is ${\log_2(\frac{4}{3})}$ . Barmpalias et al. [J Logic Comput 17(6):1041–1062, 2007] gave one method of producing such random closed sets and then computed the box dimension, and posed several questions regarding other methods of construction. We outline a method using random recursive constructions for computing the Hausdorff dimension of almost every random closed set of ${\{0,1\}^\mathbb{N}}$ , and propose a general method (...) for random closed sets in other spaces. We further find both the appropriate dimensional Hausdorff measure and the exact Hausdorff dimension for such random closed sets. (shrink)

We show that if a real x2ω is strongly Hausdorff -random, where h is a dimension function corresponding to a convex order, then it is also random for a continuous probability measure μ such that the μ-measure of the basic open cylinders shrinks according to h. The proof uses a new method to construct measures, based on effective continuous transformations and a basis theorem for -classes applied to closed sets of probability measures. We use the main result to (...) derive a collapse of randomness notions for Hausdorff measures, and to provide a characterization of effective Hausdorff dimension similar to Frostman’s Theorem. (shrink)

An effectively closed set, or ${\Pi^{0}_{1}}$ class, may viewed as the set of infinite paths through a computable tree. A numbering, or enumeration, is a map from ω onto a countable collection of objects. One numbering is reducible to another if equality holds after the second is composed with a computable function. Many commonly used numberings of ${\Pi^{0}_{1}}$ classes are shown to be mutually reducible via a computable permutation. Computable injective numberings are given for the family of ${\Pi^{0}_{1}}$ classes (...) and for the subclasses of decidable and of homogeneous ${\Pi^{0}_{1}}$ classes. However no computable numberings exist for small or thin classes. No computable numbering of trees exists that includes all computable trees without dead ends. (shrink)

The paper proves a conjecture of Solomon Feferman concerning the indefiniteness of the continuum hypothesis relative to a semi-intuitionistic set theory.

Since 2016, my embodied avatar performance (EAP) has explored healing rituals and life review at the intersection of arts, health and virtual reality (VR) for a variety of individuals, including older adults and cancer patients. EAP established a format in which the avatar mirrors the participant’s behaviours and speech, facing them during the life review process. The aspect of mirroring and facing is crucial in EAP for facilitating engagement, embodiment and empathy and a symbiotic relationship between avatar and human. This (...) article outlines the symbiosis between humans and avatars within the EAP process, focusing on the interactions where participants face and mirror their avatars. The avatars are presented as if participants are looking into a mirror. As the avatars face the participants and mimic their movements, they create an illusion similar to seeing one’s reflection in a virtual setting. The article discusses a range of mirroring aspects, including virtual mirrors in VR, echoing techniques in drama and movement therapy, and broader concepts like empathy, embodiment, we-ness and the Korean emotional concept of Cheong. Early EAP avatars, especially in the case of technical failures, will be discussed as examples. (shrink)

An o-minimal expansion of an ordered group is called semi-bounded if there is no definable bijection between a bounded and an unbounded interval in it (equivalently, it is an expansion of the group by bounded predicates and group automorphisms). It is shown that every such structure has an elementary extension.

Enterprise resource planning (ERP) has a significant impact on modern businesses by enhancing productivity, automation, and streamlining of business processes, even accounting. Manufacturers can assure proper functioning and timely client demand using ERP software. Coordination, procurement control, inventory control, and dispatch of commodities are all features of supply chain management.

Recently, research on uncertainty modeling is progressing rapidly and many essential and breakthrough stud ies have already been done. There are various ways such as fuzzy, intuitionistic and neutrosophic sets to handle these uncertainties. Although these concepts can handle incomplete information in various real-world issues, they cannot address all types of uncertainty such as indeterminate and inconsistent information. Also, plithogenic sets as a generalization of crisp, fuzzy, intuitionistic fuzzy, and neutrosophic sets, which is a set (...) whose elements are characterized by many attributes’ values. In this paper, our aim is to demonstrate and review the history of fuzzy, intuitionistic and neutrosophic sets. For this purpose, we divided the paper as: section 1. History of Fuzzy Sets, section 2. History of Intuitionistic Fuzzy Sets and section 3. History of Neutrosophic Theories and Applications, section 4. History of Plithogenic Sets. (shrink)

We prove that for every family I of closed subsets of a Polish space each Σ 1 1 set can be covered by countably many members of I or else contains a nonempty Π 0 2 set which cannot be covered by countably many members of I. We prove an analogous result for κ-Souslin sets and show that if A ♯ exists for any $A \subset \omega^\omega$ , then the above result is true for Σ 1 2 (...) class='Hi'>sets. A theorem of Martin is included stating that this result is also true for weakly homogeneously Souslin sets. As an application of our results we derive from them a general form of Hurewicz's theorem due to Kechris, Louveau, and Woodin and a theorem of Feng on the open covering axiom. Also some well-known theorems on finding "big" closed sets inside of "big" Σ 1 1 and Σ 1 2 sets are consequences of our results. (shrink)

Let κ and λ be infinite cardinals, F a filter on κ, and G a set of functions from κ to κ. The filter F is generated by G if F consists of those subsets of κ which contain the range of some element of G. The set G is $ -closed if it is closed in the $ -topology on κ κ. (In general, the $ -topology on IA has basic open sets all Π i∈ I (...) U i such that, for all $i \in I, U_i \subseteq A$ and $|\{i \in I: U_i \neq A\}| .) The primary question considered in this paper asks "Is there a uniform ultrafilter on κ which is generated by a closed set of functions?" (Closed means $ -closed.) We also establish the independence of two related questions. One is due to Carlson: "Does there exist a regular cardinal κ and a subtree T of $^{ such that the set of branches of T generates a uniform ultrafilter on κ?"; and the other is due to Pouzet: "For all regular cardinals κ, is it true that no uniform ultrafilter on κ is analytic?" We show that if κ is a singular, strong limit cardinal, then there is a uniform ultrafilter on κ which is generated by a closed set of increasing functions. Also, from the consistency of an almost huge cardinal, we get the consistency of CH + "There is a uniform ultrafilter on ℵ 1 which is generated by a closed set of increasing functions". In contrast with the above results, we show that if κ is any cardinal, λ is a regular cardinal less than or equal to κ and P is the forcing notion for adding at least $(\kappa^{ generic subsets of λ, then in V P , no uniform ultrafilter on κ is generated by a closed set of functions. (shrink)

The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskiĭ, Tseĭtin, Kreisel, and Lacombe have asserted the existence of non-empty co-r. e. closed sets devoid of computable points: sets which are even “large” in the sense of positive Lebesgue measure.This leads us to investigate for various classes of computable real subsets whether they always contain a computable point.

Let T be a one-based theory. We define a notion of width, in the case of T having the finiteness property, for the lattice of finitely generated algebraically closed sets and prove Theorem. Let T be one-based with the finiteness property. If T is of bounded width, then every type in T is nonorthogonal to a weight one type. If T is countable, the converse is true.

In this paper, we establish a relationship between the join property and Turing degrees of members of effectively closed sets in Cantor space, i.e., classes. We first give a proof of the observation that there exists a non‐empty special class in which no join of two members computes the halting set. We then prove the existence of a non‐empty special class such that no member satisfies the join property, where a degree satisfies the join property if for all (...) non‐zero there exists such that. (shrink)

This paper contains a corrected proof that the statement “every non-empty closed subset of a compact complete separable metric space is separably closed” implies the arithmetical comprehension axiom of reverse mathematics.

This work contributes to the program of studying effective versions of “almost-everywhere” theorems in analysis and ergodic theory via algorithmic randomness. Consider the setting of Cantor space {0,1}N with the uniform measure and the usual shift. We determine the level of randomness needed for a point so that multiple recurrence in the sense of Furstenberg into effectively closed sets P of positive measure holds for iterations starting at the point. This means that for each k∈N there is an (...) n such that n,2n,…,kn shifts of the point all end up in P. We consider multiple recurrence into closed sets that possess various degrees of effectiveness: clopen, Π10 with computable measure, and Π10. The notions of Kurtz, Schnorr, and Martin-Löf randomness, respectively, turn out to be sufficient. We obtain similar results for multiple recurrence with respect to the k commuting shift operators on {0,1}Nk. (shrink)

The goal of this short note is to expand the concepts of ‘pluralism’, ‘neutrosophy’, ‘refined neutrosophy’, ‘refined neutrosophic set’, ‘multineutrosophic set’, and ‘plithogeny’ (Smarandache 2002, 2013, 2017, 2019, 2021, 2023a, 2023b, 2023c), into a larger category that I will refer to as MultiAlism (or MultiPolar). As a straightforward generalization, I propose the conceptualization of a MultiPolar System (different from a PluriPolar System), which is formed not only by multiple elements that might be random, or contradictory, or adjuvant, but also (...) by accepting features from more than one basic system (UniPolar, BiPolar, TriPolar, or PluriPolar systems). PluriAlism is a closed dynamic system without neutralities nor indeterminacies, while MultiAlism is an open dynamic system with neutralities and indeterminacies. PluriAlism is a uni-system (formed by elements from a single system), while MultiAlism is a MultiSystem (formed by elements from many systems). (shrink)