We introduce for the first time the appurtenance equation and inclusion equation, which help in understanding the operations with neutrosophic numbers within the frame of neutrosophic statistics. The way of solving them resembles the equations whose coefficients are sets (not single numbers).

In this volume, we present a set of research that was published in cooperation with a number of researchers and those interested in keeping pace with the great scientific development that our contemporary world is witnessing, and one of its products was neutrosophic science, which was founded by the American scientist and mathematical philosopher Florentin Smarandache in 1995. Through it, we present a new vision for some research methods. Operations research to the concepts of this science.

We introduce Pura Vida Neutrosophic Algebra, an algebraic structure consisting of neutrosophic numbers equipped with two binary operations namely addition and multiplication. The addition can be calculated sometimes with the function min and other times with the max function. The multiplication operation is the usual sum between numbers. Pura Vida Neutrosophic Algebra is an extension of both Tropical Algebra (also known as Min-Plus, or Min-Algebra) and Max-Plus Algebra (also known as Max-algebra). (...) Tropical and Max-Plus algebras are algebraic structures included in semirings and their operations can be used in matrices and vectors. Pura Vida Neutrosophic Algebra is included in Neutrosophic semirings and can be used in Neutrosophic matrices and vectors. (shrink)

Science is the basis for managing the affairs of life and human activities, and living without knowledge is a form of wandering and a kind of loss. Using scientific methods helps us understand the foundations of choice, decision-making, and adopting the right solutions when solutions abound and options are numerous. Operational research is considered the best that scientific development has provided because its methods depend on the application of scientific methods in solving complex issues and the optimal use of available (...) resources in various fields, private and governmental work in peace and war, in politics and economics, in planning and implementation, and in various aspects of life. Its basic essence is to use the data provided for the issue under study to build a mathematical model that is the optimal solution. It is the basis on which decision makers rely in managing institutions and companies, and when operations research methods meet with the neutrosophic teacher, we get ideal solutions that take into account all the circumstances and fluctuations that may occur in the work environment over time. One of the most important operations research methods is the linear programming method. Which prompted us to reformulate the linear models, the graphical method, and the simplex method, which are used to obtain the optimal solution for linear models using the concepts of neutrosophic science. In this research, and as a continuation of what we presented previously, we will reformulate the modified simplex algorithm that was presented to address the difficulty that we were facing when applying the direct simplex algorithm. It is the large number of calculations required to be performed in each step of the solution, which requires a lot of time and effort. (shrink)

William Lane Craig has argued that there cannot be actual infinities because inverse operations are not well-defined for infinities. I point out that, in fact, there are mathematical systems in which inverse operations for infinities are well-defined. In particular, the theory introduced in John Conway's *On Numbers and Games* yields a well-defined field that includes all of Cantor's transfinite numbers.

In this paper, a modified form of Collatz conjecture for neutrosophic numbers n ∈ (Z U I) is defined. We see for any n ∈ (Z U I) the related sequence using the formula (3a + 1) + (3b + 1)I converges to any one of the 55 elements mentioned in this paper. Using the akin formula of Collatz conjecture viz. (3a- 1) + (3b -1)I the neutrosophic numbers converges to any one of the 55 elements (...) mentioned with appropriate modifications. Thus, it is conjectured that every n ∈ (Z U I) has a finite sequence which converges to any one of the 55 elements. (shrink)

This study focuses on implementing electric vehicles (EVs) in developing countries where energy production is mainly based on fossil fuels. Although for these countries the environmental short-run benefits of the EVs cannot offset the short-run costs, it may still be the best option to implement the EVs as soon as possible. Hence, it is necessary to evaluate the alternatives to introducing EVs to the market due to the environmental concerns that created an opportunity for some developing countries to catch up (...) with the international competition. Therefore, we develop a case scenario to explore the decision-making process in implementing the EVs with three alter natives and twelve criteria. We solve the decision-making problem by using Type-2 neutrosophic numbers (T2NNs) based on the RAFSI (Ranking of Alternatives through Functional mapping of criterion sub-intervals into a Single Interval) method. The proposed model combines the advantages of the RAFSI technique, and it applies T2NNs to address the uncertainties. The results show that the alternatives that may suspend the implementation of the EVs are inferior. Direct implementation of EVs is prioritized. The policy implications of the results are discussed in the study. (shrink)

The paper proposes a new technique for dealing with multi-attribute decision making problems through an extended TOPSIS method under neutrosophic cubic environment. Neutrosophic cubic set is the generalized form of cubic set and is the hybridization of a neutrosophic set with an interval neutrosophic set. In this study, we have defined some operation rules for neutrosophic cubic sets and proposed the Euclidean distance between neutrosophic cubic sets. In the decision making situation, the (...) rating of alternatives with respect to some predefined attributes are presented in terms of neutrosophic cubic information where weights of the attributes are completely unknown. In the selection process, neutrosophic cubic positive and negative ideal solutions have been defined. An extended TOPSIS method is then proposed for ranking the alternatives and finally choosing the best one. Lastly, an illustrative example is solved to demonstrate the decision making procedure and effectiveness of the developed approach. (shrink)

In this paper, we have developed an Excel package to be utilized for calculating neutrosophic data and analyze them. The use of object oriented programming techniques and concepts as they may apply to the design and development a new framework to implement neutrosophic data operations, the c# programming language, NET Framework and Microsoft Visual Studio are used to implement the neutrosophic classes. We have used Excel as it is a powerful tool that is widely accepted and (...) used for statistical analysis. Figure 1 shows Class Diagram of the implemented package. Figure 2 presents a working example of the package interface calculating the complement. Our implemented Neutrosophic package can calculate Intersection, Union, and Complement of the neutrosophic set. Figure 3 presents our neutrosophic package capability to draw figures of presented neutrosophic set. Figure 4 presents charting of Union operation calculation, and figure 5 Intersection Operation. neutrosophic set are characterized by its efficiency as it takes into consideration the three data items: True, Intermediate, and False. -/- . (shrink)

In this paper, we define for the first time three neutrosophic actions and their properties. We then introduce the prevalence order on {T, I, F} with respect to a given neutrosophic operator “o”, which may be subjective - as defined by the neutrosophic experts; and the refinement of neutrosophic entities <A>, <neutA>, and <antiA> . Then we extend the classical logical operators to neutrosophic literal logical operators and to refined literal logical operators, and we (...) define the refinement neutrosophic literal space. (shrink)

The present article delves into the extension of Knuth’s fundamental Boolean logic table to accommodate the complexities of indeterminate truth values through the integration of neutrosophic logic (Smarandache & Christianto, 2008). Neutrosophic logic, rooted in Florentin Smarandache’s groundbreaking work on Neutrosophic Logic (cf. Smarandache, 2005, and his other works), introduces an additional truth value, ‘indeterminate,’ enabling a more comprehensive framework to analyze uncertainties inherent in computational systems. By bridging the gap between traditional boolean operations and the (...) indeterminacy present in various real-world scenarios, this extension redefines logic tables, introducing neutrosophic operators that capture nuances beyond the binary realm. Through a thorough exploration of neutrosophic logic's principles and its implications in computational paradigms, this study proposes a novel approach to logic design that accommodates uncertain, imprecise, and incomplete information. This paradigm shift in logic tables not only broadens the spectrum of computing methodologies but also holds promise in fields such as decision-making systems and data analytics. This article amalgamates insights from over twelve key references encompassing seminal works in boolean logic, neutrosophic logic, and their applications in diverse scientific and computational domains, aiming to pave the way for a more robust and adaptable logic framework in computation. (shrink)

In this paper, we propose some transfor mations based on the centroid points between single valued neutrosophic numbers. We introduce these trans formations according to truth, indeterminacy and falsity value of single valued neutrosophic numbers. We propose a new similarity measure based on falsity value between single valued neutrosophic sets. Then we prove some properties on new similarity measure based on falsity value between falsity value between single valued neutrosophic sets. Furthermore, we propose similarity (...) measure based on falsity value between single valued neutrosophic sets based on the centroid points of transformed single valued neutrosophic numbers. We also apply the proposed similarity measure between single valued neutrosophic sets to deal with pattern recognition problems. (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, we propose a new hybrid neutrosophic multi criteria decision making (MCDM) framework that employs a collection of neutrosophic analytical network process (ANP), and order preference by similarity to ideal solution (TOPSIS) under bipolar neutrosophic numbers. The MCDM framework is applied for chief executive officer (CEO) selection in a case study at the Elsewedy Electric Group, Egypt. The proposed approach allows us to assemble individual evaluations of the decision makers and therefore perform accurate personnel (...) selection. The outcomes of the proposed method are compared with those of the related works such as weight sum model (WSM), weight product model (WPM), analytical hierarchy process (AHP), multiobjective optimization based on simple ratio analysis (MOORA) and ANP methods to prove and validate the results. (shrink)

Neutrosophic theory and its applications have been expanding in all directions at an astonishing rate especially after of the introduction the journal entitled “Neutrosophic Sets and Systems”. New theories, techniques, algorithms have been rapidly developed. One of the most striking trends in the neutrosophic theory is the hybridization of neutrosophic set with other potential sets such as rough set, bipolar set, soft set, hesitant fuzzy set, etc. The different hybrid structures such as rough neutrosophic (...) set, single valued neutrosophic rough set, bipolar neutrosophic set, single valued neutrosophic hesitant fuzzy set, etc. are proposed in the literature in a short period of time. Neutrosophic set has been an important tool in the application of various areas such as data mining, decision making, e-learning, engineering, law, medicine, social science, and some more. -/- This book explores the emerging field of Neutrosophic Algebraic Structures, focusing on both their theoretical foundations and practical applications. We apply innovative algorithmic methods to investigate the complex interactions of neutrosophic elements, such as neutrosophic numbers, sets, and functions, within algebraic systems. Our goal is to show how neutrosophic structures challenge and expand traditional algebraic approaches, offering solutions to problems across diverse fields like computer science, engineering, artificial intelligence, and decision-making. (shrink)

The linear programming method is one of the important methods of operations research that has been used to address many practical issues and provided optimal solutions for many institutions and companies, which helped decision makers make ideal decisions through which companies and institutions achieved maximum profit, but these solutions remain ideal and appropriate in If the conditions surrounding the work environment are stable, because any change in the data provided will affect the optimal solution and to avoid losses and (...) achieve maximum profit, we have, in previous research, reformulated the linear models using the concepts of neutrosophic science, the science that takes into account the instability of conditions and fluctuations in the work environment and leaves nothing to chance. While taking data, neutrosophic values carry some indeterminacy, giving a margin of freedom to decision makers. In another research, we reformulated one of the most important methods used to solve linear models, which is the simplex method, using the concepts of this science, and as a continuation of what we did in the previous two researches, we will reformulate in this research. The graphical method for solving linear models using the concepts of neutrosophics. We will also shed light on a case that is rarely mentioned in most operations research references, which is that when the difference between the number of unknowns and the number of constraints is equal to one, two, or three, we can also find the optimal solution graphically for some linear models. This is done by taking advantage of the conditions of non-negativity that linear models have, and we will explain this through an example in which the difference is equal to two. Also, through examples, we will explain the difference between using classical values and neutrosophic values and the extent of this’s impact on the optimal solution. (shrink)

The topics approached in the 52 papers included in this book are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation operators; multi-criteria (...) group decision-making (MCGDM); expert set; soft sets; LA-semihypergroups; single valued trapezoidal neutrosophic number; inclusion relation; Q-linguistic neutrosophic variable set; vector similarity measure; fundamental neutro-homomorphism theorem; neutro-isomorphism theorem; quasi neutrosophic triplet loop; quasi neutrosophic triplet group; BE-algebra; cloud model; Maclaurin symmetric mean; pseudo-BCI algebra; hesitant fuzzy set; photovoltaic plan; decision-making trial and evaluation laboratory (DEMATEL); Choquet integral; fuzzy measure; clustering algorithm; and many more. (shrink)

Big Data is a large-sized and complex dataset, which cannot be managed using traditional data processing tools. Mining process of big data is the ability to extract valuable information from these large datasets. Association rule mining is a type of data mining process, which is indented to determine interesting associations between items and to establish a set of association rules whose support is greater than a specific threshold. The classical association rules can only be extracted from binary data where an (...) item exists in a transaction, but it fails to deal effectively with quantitative attributes, through decreasing the quality of generated association rules due to sharp boundary problems. In order to overcome the drawbacks of classical association rule mining, we propose in this research a new neutrosophic association rule algorithm. The algorithm uses a new approach for generating association rules by dealing with membership, indeterminacy, and non-membership functions of items, conducting to an efficient decision-making system by considering all vague association rules. To prove the validity of the method, we compare the fuzzy mining and the neutrosophic mining. The results show that the proposed approach increases the number of generated association rules. (shrink)

Smarandache in 2019 has generalized the algebraic structures to NeutroAlgebraic structures and AntiAlgebraic structures. In this paper, authors, for the first time, define the NeutroAlgebra of neutrosophic triplets group under usual+ and x, built using {Zn, x}, n a composite number, 5 < n < oo, which are not partial algebras. As idempotents in Zn alone are neutrals that contribute to neutrosophic triplets groups, we analyze them and build NeutroAlgebra of idempotents under usual + and x, which are (...) not partial algebras. We prove in this paper the existence theorem for NeutroAlgebra of neutrosophic triplet groups. This proves the neutrals assocaited with neutrosophic triplet groups in { Zn, X} under product is a NeutroAlgebra of triplets. We also prove the non-existence theorem of NeutroAlgebra for neutrosophic triplets in case of Zn when n = 2p, 3p and 4p (for some primes p). Several open problems are proposed. Further, the NeutroAlgebras of extended neutrosophic triplet groups have been obtained. (shrink)

In graph theory, the concept of domination is essential in a variety of domains. It has broad applications in diverse fields such as coding theory, computer net work models, and school bus routing and facility lo cation problems. If a fuzzy graph fails to obtain acceptable results, neutrosophic sets and neutrosophic graphs can be used to model uncertainty correlated with indeterminate and inconsistent information in arbitrary real-world scenario. In this study, we consider the concept of domination as (...) it relates to single-valued neutrosophic incidence graphs (SVNIGs). Given the importance of domination and its utilization in numerous fields, we propose the application of dominating sets in SVNIG with valid edges. We present some relevant definitions such as those of valid edges, cardinality, and isolated vertices in SVNIG along with some examples. Furthermore, we also show a few significant sets connected to the dominating set in an SVNIG such as independent and irredundant sets. We also investigate a relationship between the concepts of dominating sets and domination numbers as well as irredundant and independence sets in SVNIGs. Finally, a real-life deployment of domination in SVNIGsis investigated in relation to COVID-19 vaccination locations as a practical application. (shrink)

The purpose of this paper is to introduce new types of neutrosophic crisp sets with three types 1, 2, 3. After given the fundamental definitions and operations, we obtain several properties, and discussed the relationship between neutrosophic crisp sets and others. Also, we introduce and study the neutrosophic crisp point and neutrosophic crisp relations. Possible applications to database are touched upon.

The topics approached in this collection of papers are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation operators; multi-criteria group decision-making (MCGDM); (...) expert set; soft sets; LA-semihypergroups; single valued trapezoidal neutrosophic number; inclusion relation; Q-linguistic neutrosophic variable set; vector similarity measure; fundamental neutro-homomorphism theorem; neutro-isomorphism theorem; quasi neutrosophic triplet loop; quasi neutrosophic triplet group; BE-algebra; cloud model; fuzzy measure; clustering algorithm; and many more. (shrink)

The field of neutrosophic set theory and its applications has been rapidly expanding, particularly since the introduction of the journal "Neutrosophic Sets and Systems." New theories, techniques, and algorithms are being developed at a very high rate. One of the most notable trends in neutrosophic theory is its hybridization with other set theories such as rough set theory, bipolar set theory, soft set theory, hesitant fuzzy set theory, and more. Various hybrid structures like rough neutrosophic (...) sets, neutrosophic soft set, single valued neutrosophic hesitant fuzzy sets, among others, have been proposed in a short period. Neutrosophic sets have proven to be crucial tools across a wide array of fields including data mining, decision making, e-learning, engineering, medical diagnosis, social sciences, and beyond. -/- The third volume in the series “New Trends in Neutrosophic Theories and Applications” focuses on theories, methods, and algorithms for decision making, as well as applications involving neutrosophic information. Some topics introduce new sets such as the Pythagorean neutrosophic vague soft set, the triangular fuzzy penta-partitioned neutrosophic set, interval-valued neutrosophic b-open sets, and interval-valued neutrosophic b-closed sets. Other topics present applications in medical diagnosis, non-preemptive neutrosophic priority queues with uneven services (labeled as NM/NM/1), AHP in an interval neutrosophic set environment, MAGDM in a triangular fuzzy neutrosophic number environment, MAGDM in a pentapartitioned neutrosophic environment, the entropy-ARAS strategy in a single-valued neutrosophic number environment, and the MABAC strategy in a rough neutrosophic set environment. (shrink)

This paper is devoted to present Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) method for multi-attribute group decision making under rough neutrosophic environment. The concept of rough neutrosophic set is a powerful mathematical tool to deal with uncertainty, indeterminacy and inconsistency. In this paper, a new approach for multi-attribute group decision making problems is proposed by extending the TOPSIS method under rough neutrosophic environment. Rough neutrosophic set is characterized by the upper and (...) lower approximation operators and the pair of neutrosophic sets that are characterized by truth-membership degree, indeterminacy membership degree, and falsity membership degree. In the decision situation, ratings of alternatives with respect to each attribute are characterized by rough neutrosophic sets that reflect the decision makers’ opinion. Rough neutrosophic weighted averaging operator has been used to aggregate the individual decision maker’s opinion into group opinion for rating the importance of attributes and alternatives. Finally, a numerical example has been provided to demonstrate the applicability and effectiveness of the proposed approach. (shrink)

Operations research science is defined as the science that is concerned with applying scientific methods to complex problems in managing and directing large systems of people, including resources and tools in various fields, private and governmental work, peace and war, politics, administration, economics, planning and implementation in various domains. It uses scientific methods that take the language of mathematics as a basis for it and uses computer, without which it would not have been possible to achieve numerical solutions (...) to the raised problems, those that need correct solutions, when the solutions abound and the options are multiple, so we need a decision based on correct scientific foundations and takes into account all the circumstances and changes that you can encounter the decision-maker during the course of work, and nothing is left to chance or luck, but rather everything that enters into the account and plays its role in decision-making, and we get that when we use the concepts of neutrosophic science to reformulate what the science of operations research presented in terms of methods and methods to solve many practical problems, so we will present in this research a study aimed at shedding light on the most important methods used to solve nonlinear models, which is the Lagrangian multiplier method for nonlinear models constrained by equality and then reformulated using the concepts of neutrosophic science. (shrink)

Today, soft computing is a field that is used a lot in solving real-world problems, such as problems in economics, finance, banking... With the aim to serve for solving the real problem, many new theories and/or tools which were proposed, improved to help soft computing used more efficiently. We can mention some theories as fuzzy sets theory (L. Zadeh, 1965), intuitionistic fuzzy set (K Atanasov, 1986), neutrosophic set (F. Smarandache 1999). In this paper, we introduce a new notion (...) of sup port-neutrosophic set (SNS), which is the combination a neutrosophic set with a fuzzy set. So, SNS set is a direct extension of fuzzy set and neutrosophic sets (F. Smarandache). Then, we define some operators on the support-neutrosophic sets, and investigate some properties of these operators. (shrink)

A contradiction is obtained, considering the axiom of infinity, then ℕ and Peano axioms, together a list of ℕ subsets and with inclusion relation and union operation. Natural numbers constitute an infinite set, ℕ, but we show the union of its proper subsets, with a specific form, isn’t an infinite set. Also we get a simpler explanation and a symbolic representation. Lastly, inconsistency of Peano successor axiom is a consequence of rejecting infinity.

The traditional soft set is a mapping from a parameter set to family of all crisp subsets of a universe. Molodtsov introduced the soft set as a generalized tool for modelling complex systems involving uncertain or not clearly defined objects. In this paper, the notion of neutrosophic soft set is reanalysed. The novel theory is a combination of neutrosophic set theory and soft set theory. The complement, “and”, “or”, intersection and union operations are defined on the (...) class='Hi'>neutrosophic soft sets. The neutrosophic soft relations accompanied with their compositions are also defined. The basic properties of the neutrosophic soft sets, neutrosophic soft relations and neutrosophic soft compositions are also discussed. (shrink)

India dropped its target of 500 GW of renewable energy capacity fossil fuel sources by 2030. Its responsibilities the United Nations Framework Convention Climate Change [UNFCCC],and reducing radiations by one billion tonnes by the end of the decade at the COP26 conference, held in Glasgow in November 2022. Researchers are continually searching for inexhaustible and reasonable energy sources. Solar energy is one of the greenest sources of energy and is also one of the cleanest. The most important factor in using (...) solar energy is the location of the solar power plant. The main objective of this study is to find the best location for a new solar power plant in a specific region called Bundelkhand region of Uttar Pradesh in India. Here we offer an extension of ELECTRE III method as two-phase Pythagorean neutrosophic elimination and choice translating reality PN-ELECTRE-III) method to adapt with fuzzy, ambiguous, unsure, and indeterminate criteria. The Pythagorean neutrosophic numbers [PNNs] used by the group decision support system of PN-ELECTRE III to measure performance of the alternatives. The options are entirely outclassed in the subsequent stage in view of the past stage's evaluations of them. By defining PNN we describe the technique of indifference threshold functions, preference treshold and veto threshold functions, which provide a more stable basis to drop outranking relations. By calculating the concordance credibility, discordance credibility and net credibility degrees of each alternative, the ranking module of the PN-ELECTRE III approach is made simpler. In order to confirm the applicability of the strategy suggested in this paper, the location selection problem for solar plants is finaly solved. (shrink)

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)

In this paper, we introduce the concepts of Pythagorean fuzzy valued neutrosophic set (PFVNS) and Pythagorean fuzzy valued neutrosophic (PFVNV) constructed by considering Pythagorean fuzzy values (PFVs) instead of numbers for the degrees of the truth, the indeterminacy and the falsity, which is a new extension of intuitionistic fuzzy valued neutrosophic set (IFVNS). By means of PFVNSs, the degrees of the truth, the indeterminacy and the falsity can be given in Pythagorean fuzzy environment and more sensitive (...) evaluations are made by a decision maker in decision making problems compared to IFVNSs. In other words, such sets enable a decision maker to evaluate the degrees of the truth, the indeterminacy and the falsity as PFVs to model the uncertainty in the evaluations. (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)

An important method for finding the optimal solution for linear and nonlinear models is the graphical method, which is used if the linear or nonlinear mathematical model contains one, two, or three variables. The models that contain only two variables are among the most models for which the optimal solution has been obtained graphically, whether these models are linear or non-linear in references and research that are concerned with the science of operations research, when the data of the (...) issue under study is classical data. In this research, we will present a study through, which we present the graphical method for solving Neutrosophical nonlinear models in the following case: A nonlinear programming issue, the objective function is a nonlinear function, and the constraints are linear functions. Note that we can use the same method if (i) the objective function follower is a linear follower and the constraints are nonlinear; (ii) the objective function is a non-linear follower and the constraints are non-linear. In the three cases, the nonlinear models are neutrosophic, and as we know, the mathematical model is a nonlinear model if any of the components of the objective function or the constraints are nonlinear expressions, and the nonlinear expressions may be in both. At the left end of the constraints are neutrosophic values, at least one or all of them. Then, the possible solutions to the neutrosophic nonlinear programming problem are the set of rays that fulfills all the constraints. As for the region of possible solutions, it is the region that contains all the rays that fulfill the constraints. The optimal solution is the beam that fulfills all constraints and at which the function reaches a maximum or minimum value, depending on the nature of the issue under study (noting that it is not necessary to be alone). (shrink)

This work introduces the framework for selecting architecture in 5G networks, considering various technological, performance, economic, and operational factors. With the emergence of 5G technology, the architecture selection process has become pivotal in meeting diverse requirements for ultra-high-speed connectivity, low latency, scalability, and diverse service demands. The evaluation comprehensively analyses different architecture options, including centralized, distributed, cloud-based, and virtualized architectures. Factors such as network performance, scalability, cost-effectiveness, security, and compatibility are considered within a multi-criteria decision-making framework. Findings reveal each (...) architecture option's diverse strengths and limitations, emphasizing the importance of aligning architectural choices with specific use cases, deployment scenarios, and business objectives. We used the concept of multi-criteria decision-making (MCDM) methodology to control the various criteria. We used the single-valued neutrosophic set (SVNS) to deal with vague and inconsistent data. The SVNS is integrated with the hyperSoft set. The proposed methodology uses a single-valued neutrosophic hyperSoft set (SVNHSS) to select the best 5G architecture. We used the VIKOR method as an MCDM method to rank the alternatives. The proposed framework provides stakeholders with a structured methodology to evaluate and prioritize architecture options, facilitating informed decision-making in the complex landscape of 5G network deployments. (shrink)

Predicates are term-to-sentence devices, and operators are sentence-to-sentence devices. What Kaplan and Montague's Paradox of the Knower demonstrates is that necessity and other modalities cannot be treated as predicates, consistent with arithmetic; they must be treated as operators instead. Such is the current wisdom.A number of previous pieces have challenged such a view by showing that a predicative treatment of modalities neednot raise the Paradox of the Knower. This paper attempts to challenge the current wisdom in another way as (...) well: to show that mere appeal to modal operators in the sense of sentence-to-sentence devices is insufficient toescape the Paradox of the Knower. A family of systems is outlined in which closed formulae can encode other formulae and in which the diagonal lemma and Paradox of the Knower are thereby demonstrable for operators in this sense. (shrink)

The second volume of “Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond” presents a deep exploration of the progress in uncertain combinatorics through innovative methodologies like graphization, hyperization, and uncertainization. This volume integrates foundational concepts from fuzzy, neutrosophic, soft, and rough set theory, among others, to further advance the field. Combinatorics and set theory, two central pillars of mathematics, focus on counting, arrangement, and the study of collections under defined rules. Combinatorics excels (...) in handling uncertainty, while set theory has evolved with concepts such as fuzzy and neutrosophic sets, which enable the modeling of complex real-world uncertainties by addressing truth, indeterminacy, and falsehood. These advancements, when combined with graph theory, give rise to novel forms of uncertain sets in "graphized" structures, including hypergraphs and superhypergraphs. Innovations such as Neutrosophic Oversets, Undersets, and Offsets, as well as the Nonstandard Real Set, build upon traditional graph concepts, pushing both theoretical and practical boundaries. The synthesis of combinatorics, set theory, and graph theory in this volume provides a robust framework for addressing the complexities and uncertainties inherent in both mathematical and real-world systems, paving the way for future research and application. In the first chapter, “A Review of the Hierarchy of Plithogenic, Neutrosophic, and Fuzzy Graphs: Survey and Applications”, the authors investigate the interrelationships among various graph classes, including Plithogenic graphs, and explore other related structures. Graph theory, a fundamental branch of mathematics, focuses on networks of nodes and edges, studying their paths, structures, and properties. A Fuzzy Graph extends this concept by assigning a membership degree between 0 and 1 to each edge and vertex, representing the level of uncertainty. The Turiyam Neutrosophic Graph is introduced as an extension of both Neutrosophic and Fuzzy Graphs, while Plithogenic graphs offer a potent method for managing uncertainty. The second chapter, “Review of Some Superhypergraph Classes: Directed, Bidirected, Soft, and Rough”, examines advanced graph structures such as directed superhypergraphs, bidirected hypergraphs, soft superhypergraphs, and rough superhypergraphs. Classical graph classes include undirected graphs, where edges lack orientation, and directed graphs, where edges have specific directions. Recent innovations, including bidirected graphs, have sparked ongoing research and significant advancements in the field. Soft Sets and their extension to Soft Graphs provide a flexible framework for managing uncertainty, while Rough Sets and Rough Graphs address uncertainty by using lower and upper approximations to handle imprecise data. Hypergraphs generalize traditional graphs by allowing edges, or hyperedges, to connect more than two vertices. Superhypergraphs further extend this by allowing both vertices and edges to represent subsets, facilitating the modeling of hierarchical and group-based relationships. The third chapter, “Survey of Intersection Graphs, Fuzzy Graphs, and Neutrosophic Graphs”, explores the intersection graph models within the realms of Fuzzy Graphs, Intuitionistic Fuzzy Graphs, Neutrosophic Graphs, Turiyam Neutrosophic Graphs, and Plithogenic Graphs. The chapter highlights their mathematical properties and interrelationships, reflecting the growing number of graph classes being developed in these areas. Intersection graphs, such as Unit Square Graphs, Circle Graphs, and Ray Intersection Graphs, are crucial for understanding complex graph structures in uncertain environments. The fourth chapter, “Fundamental Computational Problems and Algorithms for SuperHyperGraphs”, addresses optimization problems within the SuperHypergraph framework, such as the SuperHypergraph Partition Problem, Reachability, and Minimum Spanning SuperHypertree. The chapter also adapts classical problems like the Traveling Salesman Problem and the Chinese Postman Problem to the SuperHypergraph context, exploring how hypergraphs, which allow hyperedges to connect more than two vertices, can be used to solve complex hierarchical and relational problems. The fifth chapter, “A Short Note on the Basic Graph Construction Algorithm for Plithogenic Graphs”, delves into algorithms designed for Plithogenic Graphs and Intuitionistic Plithogenic Graphs, analyzing their complexity and validity. Plithogenic Graphs model multi-valued attributes by incorporating membership and contradiction functions, offering a nuanced representation of complex relationships. The sixth chapter, “Short Note of Bunch Graph in Fuzzy, Neutrosophic, and Plithogenic Graphs”, generalizes traditional graph theory by representing nodes as groups (bunches) rather than individual entities. This approach enables the modeling of both competition and collaboration within a network. The chapter explores various uncertain models of bunch graphs, including Fuzzy Graphs, Neutrosophic Graphs, Turiyam Neutrosophic Graphs, and Plithogenic Graphs. In the seventh chapter, “A Reconsideration of Advanced Concepts in Neutrosophic Graphs: Smart, Zero Divisor, Layered, Weak, Semi, and Chemical Graphs”, the authors extend several fuzzy graph classes to Neutrosophic graphs and analyze their properties. Neutrosophic Graphs, a generalization of fuzzy graphs, incorporate degrees of truth, indeterminacy, and falsity to model uncertainty more effectively. The eighth chapter, “Short Note of Even-Hole-Graph for Uncertain Graph”, focuses on Even-Hole-Free and Meyniel Graphs analyzed within the frameworks of Fuzzy, Neutrosophic, Turiyam Neutrosophic, and Plithogenic Graphs. The study investigates the structure of these graphs, with an emphasis on their implications for uncertainty modeling. The ninth chapter, “Survey of Planar and Outerplanar Graphs in Fuzzy and Neutrosophic Graphs”, explores planar and outerplanar graphs, as well as apex graphs, within the contexts of fuzzy, neutrosophic, Turiyam Neutrosophic, and plithogenic graphs. The chapter examines how these types of graphs are used to model uncertain parameters and relationships in mathematical and real-world systems. The tenth chapter, “General Plithogenic Soft Rough Graphs and Some Related Graph Classes”, introduces and explores new concepts such as Turiyam Neutrosophic Soft Graphs and General Plithogenic Soft Graphs. The chapter also examines models of uncertain graphs, including Fuzzy, Intuitionistic Fuzzy, Neutrosophic, and Plithogenic Graphs, all designed to handle uncertainty in diverse contexts. The eleventh chapter, “Survey of Trees, Forests, and Paths in Fuzzy and Neutrosophic Graphs”, provides a comprehensive study of Trees, Forests, and Paths within the framework of Fuzzy and Neutrosophic Graphs. This chapter focuses on classifying and analyzing graph structures like trees and paths in uncertain environments, contributing to the ongoing development of graph theory in the context of uncertainty. (shrink)

In this paper, we introduce the plithogenic set (as generalization of crisp, fuzzy, intuitionistic fuzzy, and neutrosophic sets), which is a set whose elements are characterized by many attributes (parameters)’ values. An attribute value v has a corresponding (fuzzy, intuitionistic fuzzy, or neutrosophic) degree of appurtenance d(x,v) of the element x, to the set P, with respect to some given criteria. In order to obtain a better accuracy for the plithogenic aggregation operators in the plithogenic set, and (...) for a more exact inclusion (partial order), a (fuzzy, intuitionistic fuzzy, or neutrosophic) contradiction (dissimilarity) degree is defined be-tween each attribute value and the dominant (most important) attribute value. The plithogenic intersection and union are linear combinations of the fuzzy operators tnorm and tconorm, while the plithogenic complement, inclusion (inequality), equality are influenced by the attribute values contradiction (dissimilarity) degrees. This article offers some examples and applications of these new concepts in our everyday life. (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)

Darwiche and Pearl’s seminal 1997 article outlined a number of baseline principles for a logic of iterated belief revision. These principles, the DP postulates, have been supplemented in a number of alternative ways. Most suggestions have resulted in a form of ‘reductionism’ that identifies belief states with orderings of worlds. However, this position has recently been criticised as being unacceptably strong. Other proposals, such as the popular principle (P), aka ‘Independence’, characteristic of ‘admissible’ operators, remain commendably more modest. In (...) this paper, we supplement the DP postulates and (P) with a number of novel conditions. While the DP postulates constrain the relation between a prior and a posterior conditional belief set, our new principles notably govern the relation between two posterior conditional belief sets obtained from a common prior by different revisions. We show that operators from the resulting family, which subsumes both lexicographic and restrained revision, can be represented as relating belief states associated with a ‘proper ordinal interval’ (POI) assignment, a structure more fine-grained than a simple ordering of worlds. We close the paper by noting that these operators satisfy iterated versions of many AGM era postulates, including Superexpansion, that are not sound for admissible operators in general. (shrink)

The study aimed to identify the intermediate role of the standard of operations in the relationship between the focus on students and beneficiaries in achieving satisfaction of students in Palestinian universities. The study used the analytical descriptive method. The study was conducted on university leadership in Al-Azhar, Islamic and Al-Aqsa Universities. The study sample consisted of (200) individuals, 182 of whom responded, and the questionnaire was used in collecting the data. The results of the study were as follows: - (...) There is a statistically significant effect on the adoption of the criterion of focus on the students benefiting to achieve the satisfaction of students in the Palestinian universities, where the value of R Square (35.3%), there is a statistically significant effect on the adoption of the criterion of focus on the students benefiting on the use of the standard of operations in Palestinian universities. The value of the R Square is (62.8%), there is a statistically significant impact of the criterion of operations on the satisfaction of students in Palestinian universities. Where the value of the R is (36.2%), there is a significant effect on the adoption of the criterion of emphasis on students benefiting from the satisfaction of students in Palestinian universities with the existence of the standard of operations as an intermediary variable. The role of the mediator in the relationship between the adoptions of the criterion of focus on the students benefiting to achieve the satisfaction of students in Palestinian universities was revealed through the use of Path Analysis. The study presented a number of recommendations, the most important of which is: to increase the focus of the universities on students and beneficiaries in a manner appropriate to achieve the objectives of the university on the one hand, and students and beneficiaries on the other, and in line with the approach of quality and excellence, the universities more attention to the management of operations through the design and development of programs Academic and internal services according to the needs of students, and improving processes in innovative ways to generate added value for students and beneficiaries, the universities have made more efforts to create satisfaction among students and beneficiaries by developing internal performance indicators to measure student satisfaction, Students and other university beneficiaries periodically to improve their satisfaction. (shrink)

In this thesis, I give a metascientific account of causality in medicine. I begin with two historical cases of causal discovery. These are the discovery of the causation of Burkitt’s lymphoma by the Epstein-Barr virus, and of the various viral causes suggested for cervical cancer. These historical cases then support a philosophical discussion of causality in medicine. This begins with an introduction to the Russo- Williamson thesis (RWT), and discussion of a range of counter-arguments against it. Despite these, (...) I argue that the RWT is historically workable, given a small number of modifications. I then expand Russo and Williamson’s account. I first develop their suggestion that causal relationships in medicine require some kind of evidence of mechanism. I begin with a number of accounts of mechanisms and produce a range of consensus features of them. I then develop this consensus position by reference to the two historical case studies with an eye to their operational competence. In particular, I suggest that it is mechanistic models and their representations which we are concerned with in medicine, rather than the mechanism as it exists in the world. -/- I then employ these mechanistic models to give an account of the sorts of evidence used in formulating and evaluating causal claims. Again, I use the two human viral oncogenesis cases to give this account. I characterise and distinguish evidence of mechanism from evidence of difference-making, and relate this to mechanistic models. I then suggest the relationship between types of evidence presents us with a means of tackling the reference-class problem. This sets the scene for the final chapter. Here, I suggest the manner in which these two different classes of evidence become integrated is also reflected in the way that developing research programmes change as their associated causal claims develop. (shrink)

The paper considers a new type of objects – blinking fractals – that are not covered by traditional theories studying dynamics of self-similarity processes. It is shown that the new approach allows one to give various quantitative characteristics of the newly introduced and traditional fractals using infinite and infinitesimal numbers proposed recently. In this connection, the problem of the mathematical modelling of continuity is discussed in detail. A strong advantage of the introduced computational paradigm consists of its well-marked numerical (...) character and its own instrument – Infinity Computer – able to execute operations with infinite and infinitesimal numbers. (shrink)

Since independence, at least 28 African countries have legalized some form of gambling. Yet a range of informal gambling activities have also flourished, often provoking widespread public concern about the negative social and economic impact of unregulated gambling on poor communities. This article addresses an illegal South African numbers game called fahfee. Drawing on interviews with players, operators, and regulatory officials, this article explores two aspects of this game. First, it explores the lives of both players and runners, (...) as well as the clandestine world of the Chinese operators who control the game. Second, the article examines the subjective motivations and aspirations of players, and asks why they continue to play, despite the fact that their aggregate losses easily outstrip their aggregate gains. In contrast with those who reduce its appeal simply to the pursuit of wealth, I conclude that, for the (mostly) black, elderly, working class women who play fahfee several times a week, the associated trade-off—regular, small losses, versus the social enjoyment of playing and the prospect of occasional but realistic windfalls—takes on a whole new meaning, and preferences for relatively lumpy rather than steady consumption streams help explain the continued attraction of fahfee. This reinforces the need to understand players’ own accounts of gambling utility rather than simply to moralistically condemn gambling or to dismiss gamblers behaviour as irrational. (shrink)

In his highly perceptive, if underappreciated introduction to Wittgenstein’s Tractatus, Russell identifies a “lacuna” within Wittgenstein’s theory of number, relating specifically to the topic of transfinite number. The goal of this paper is two-fold. The first is to show that Russell’s concerns cannot be dismissed on the grounds that they are external to the Tractarian project, deriving, perhaps, from logicist ambitions harbored by Russell but not shared by Wittgenstein. The extensibility of Wittgenstein’s theory of number to the case of transfinite (...) cardinalities is, I shall argue, a desideratum generated by concerns intrinsic, and internal to Wittgenstein’s logical and semantic framework. Second, I aim to show that Wittgenstein’s theory of number as espoused in the Tractatus is consistent with Russell’s assessment, in that Wittgenstein meant to leave open the possibility that transfinite numbers could be generated within his system, but did not show explicitly how to construct them. To that end, I show how one could construct a transfinite number line using ingredients inherent in Wittgenstein’s system, and in accordance with his more general theories of number and of operations. (shrink)

In this paper, we explore the properties and optimization techniques related to polyhedral cones and energy numbers with a focus on the cone of positive semidefinite matrices and efficient computation strategies for kernels. In Part (a), we examine the polyhedral nature of the cone of positive semidefinite matrices, , establishing that it does not form a polyhedral cone for due to its infinite dimensional characteristics. In Part (b), we present an algorithm for efficiently computing the kernel function on-the-fly, (...) leveraging a polyhedral description of the convex hull generated by the feature mappings and . By restructuring the problem and using gradient-based optimization techniques, our approach minimizes memory usage and computational overhead, thus enabling scalable computation. Through examples and visualizations, we demonstrate the practical applications and efficiency of the proposed algorithm in optimizing these kernel computations. (shrink)

Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while in the presence of weaker decidability conditions for terms they produce various superintuitionistic intermediate logics. In this thesis, I argue that there are important philosophical lessons to be learned from these results. To make the case, I begin with a historical discussion situating the development of Hilbert’s operators in relation to his evolving program in (...) the foundations of mathematics and in relation to philosophical motivations leading to the development of intuitionistic logic. This sets the stage for a brief description of the relevant part of Dummett’s program to recast debates in metaphysics, and in particular disputes about realism and anti-realism, as closely intertwined with issues in philosophical logic, with the acceptance of classical logic for a domain reflecting a commitment to realism for that domain. Then I review extant results about what is provable and what is not when one adds epsilon to intuitionistic logic, largely due to Bell and DeVidi, and I give several new proofs of intermediate logics from intuitionistic logic+ε without identity. With all this in hand, I turn to a discussion of the philosophical significance of choice operators. Among the conclusions I defend are that these results provide a finer-grained basis for Dummett’s contention that commitment to classically valid but intuitionistically invalid principles reflect metaphysical commitments by showing those principles to be derivable from certain existence assumptions; that Dummett’s framework is improved by these results as they show that questions of realism and anti-realism are not an “all or nothing” matter, but that there are plausibly metaphysical stances between the poles of anti-realism and realism, because different sorts of ontological assumptions yield intermediate rather than classical logic; and that these intermediate positions between classical and intuitionistic logic link up in interesting ways with our intuitions about issues of objectivity and reality, and do so usefully by linking to questions around intriguing everyday concepts such as “is smart,” which I suggest involve a number of distinct dimensions which might themselves be objective, but because of their multivalent structure are themselves intermediate between being objective and not. Finally, I discuss the implications of these results for ongoing debates about the status of arbitrary and ideal objects in the foundations of logic, showing among other things that much of the discussion is flawed because it does not recognize the degree to which the claims being made depend on the presumption that one is working with a very strong logic. (shrink)

The aim of the paper is to analyze the expressive power of the square operator of Łukasiewicz logic: ∗x=x⊙x⁠, where ⊙ is the strong Łukasiewicz conjunction. In particular, we aim at understanding and characterizing those cases in which the square operator is enough to construct a finite MV-chain from a finite totally ordered set endowed with an involutive negation. The first of our main results shows that, indeed, the whole structure of MV-chain can be reconstructed from the involution and (...) the Łukasiewicz square operator if and only if the obtained structure has only trivial subalgebras and, equivalently, if and only if the cardinality of the starting chain is of the form n+1 where n belongs to a class of prime numbers that we fully characterize. Secondly, we axiomatize the algebraizable matrix logic whose semantics is given by the variety generated by a finite totally ordered set endowed with an involutive negation and Łukasiewicz square operator. Finally, we propose an alternative way to account for Łukasiewicz square operator on involutive Gödel chains. In this setting, we show that such an operator can be captured by a rather intuitive set of equations. (shrink)

Beginning with the work of Olafur Eliasson, with particular reference to the recent exhibition “Trembling Horizons” but not limited to it, a number of works representative of an artistic vision that might be called eco-logical are analyzed. Not only by explicitly thematizing the issue of the environmental crisis, Eliasson's works seem to materially express the demands of theorists who question how art can actively respond to the need for a shift in outlook that characterizes current events. Starting from (...) the idea of art as praxis, which allows the viewer to regard himself or herself and to place himself or herself in relation to what surrounds us – human and non-human – Eliasson's works act on the intrinsic objecthood of the work itself by creating a relationship with otherness and datity. They generate, therefore, a feeling of proximity, which concretizes a meaning of creativity in a transformative and site-specific sense; they promote an eco-logic that has its basis in a nomadic and depotentiated vision of subjectivity, engendering a feeling of interconnectedness and care. It will be argued in this paper the need to rethink art in these terms by hypothesizing a particular efficacy of some works that actively work in public space: places where the split between nature and culture has taken place, urban and public space are privileged contexts to actively promote the overcoming of this fracture and generate ethically responsible, already intrinsically ecological subjects. (shrink)

-/- A variable binding term operator (vbto) is a non-logical constant, say v, which combines with a variable y and a formula F containing y free to form a term (vy:F) whose free variables are exact ly those of F, excluding y. -/- Kalish-Montague proposed using vbtos to formalize definite descriptions, set abstracts {x: F}, minimalization in recursive function theory, etc. However, they gave no sematics for vbtos. Hatcher gave a semantics but one that has flaws. We give a (...) correct semantic analysis of vbtos. We also give axioms for using them in deductions. And we conjecture strong completeness for the deductions with respect to the semantics. The conjecture was later proved independently by the authors and by Newton da Costa. -/- The expression (vy:F) is called a variable bound term (vbt). In case F has only y free, (vy:F) has the syntactic propreties of an individual constant; and under a suitable interpretation of the language vy:F) denotes an individual. By a semantic analysis of vbtos we mean a proposal for amending the standard notions of (1) "an interpretation o f a first -order language" and (2) " the denotation of a term under an interpretation and an assignment", such that (1') an interpretation o f a first -order language associates a set-theoretic structure with each vbto and (2') under any interpretation and assignment each vb t denotes an individual. (shrink)