Many results have been obtained on isolated graphs and complete graphs. In this paper, a necessary and sufficient condition will be proved for a single valued neutrosophic graph to be an isolated single valued neutrosophic graph.

In this research paper, the graph of the bipolar single-valued neutrosophic set model (BSVNS) is proposed. The graphs of single valued neutrosophic set models is generalized by this graph. For the BSVNS model, several results have been proved on complete and isolated graphs. Adding, an important and suitable condition for the graphs of the BSVNS model to become an isolated graph of the BSVNS model has been demonstrated.

In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.

Neutrosophic theory has many applications in graph theory, bipolar single valued neutrosophic graphs (BSVNGs) is the generalization of fuzzy graphs and intuitionistic fuzzy graphs, SVNGs. In this paper we introduce some types of BSVNGs, such as subdivision BSVNGs, middle BSVNGs, total BSVNGs and bipolar single valued neutrosophic line graphs (BSVNLGs), also investigate the isomorphism, co weak isomorphism and weak isomorphism properties of subdivision BSVNGs, middle BSVNGs, total BSVNGs and BSVNLGs.

In this paper, we define the regular and totally regular single valued neutrosophic hypergraphs, and discuss the order and size along with properties of regular and totally regular single valued neutrosophic hypergraphs. We also extend work on completeness of single valued neutrosophic hypergraphs.

In this paper, we define the regular and totally regular bipolar single valued neutrosophic hypergraphs, and discuss the order and size along with properties of regular and totally regular bipolar single valued neutrosophic hypergraphs. We extend work on completeness of bipolar single valued neutrosophic hypergraphs.

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)

In this paper, we introduce the notion of single-valued neutrosophic soft uniform spaces as a view point of the entourage approach. We investigate the relationship among single-valued neutrosophic soft uniformities, single-valued neutrosophic soft topologies and single-valued neutrosophic soft interior operators. Also, we study several single-valued neutrosophic soft topologies induced by a single-valued neutrosophic soft uniform space.

Clustering plays an important role in data mining, pattern recognition, and machine learning. Then, single-valued neutrosophic sets are a useful means to describe and handle indeterminate and inconsistent information, which fuzzy sets and intuitionistic fuzzy sets cannot describe and deal with. To cluster the data represented by single-value neutrosophic information, the article proposes a single-valued neutrosophic minimum spanning tree clustering algorithm. Firstly, we defined a generalized distance measure between SVNSs. Then, we present (...) an SVNMST clustering algorithm for clustering single-value neutrosophic data based on the generalized distance measure of SVNSs. Finally, two illustrative examples are given to demonstrate the application and effectiveness of the developed approach. (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)

This paper introduces a refined single-valued neutrosophic set (RSVNS) and presents a similarity measure of RSVNSs. Then a multicriteria decision-making method with RSVNS information is developed based on the similarity measure of RSVNSs. By the similarity measure between each alternative and the ideal solution (ideal alternative), all the alternatives can be ranked and the best one can be selected as well. Finally, an actual example on the selecting problems of construction projects demonstrates the application and effectiveness of (...) the proposed method. (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 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)

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 (...) class='Hi'>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)

This paper introduces the concept of single-valued neutrosophic hyper \(BCK\)-subalgebras as a generalization and alternative of hyper \(BCK\)-algebras and on any given nonempty set constructs at least one single-valued neutrosophic hyper \(BCK\)-subalgebra and one a single-valued neutrosophic hyper \(BCK\)-ideal. In this study level subsets play the main role in the connection between singlevalued neutrosophic hyper \(BCK\)-subalgebras and hyper \(BCK\)-subalgebras and the connection between single-valued neutrosophic hyper \(BCK\)-ideals and (...) hyper \(BCK\)-ideals. The congruence and (strongly) regular equivalence relations are the important tools for connecting hyperstructures and structures, so the major contribution of this study is to apply and introduce a (strongly) regular relation on hyper \(BCK\)-algebras and to investigate their categorical properties (quasi commutative diagram) via single-valued neutrosophic hyper \(BCK\)-ideals. Indeed, by using the single-valued neutrosophic hyper \(BCK\)-ideals, we define a congruence relation on (weak commutative) hyper \(BCK\)-algebras that under some conditions is strongly regular and the quotient of any (single-valued neutrosophic)hyper \(BCK\)-(sub)algebra via this relation is a (single-valued neutrosophic)(hyper \(BCK\)-subalgebra) \(BCK\)-(sub)algebra. (shrink)

Clustering plays an important role in data mining, pattern recognition, and machine learning. Single-valued neutrosophic sets are useful means to describe and handle indeterminate and inconsistent information that fuzzy sets and intuitionistic fuzzy sets cannot describe and deal with. To cluster the data represented by single-valued neutrosophic information, this article proposes single-valued neutrosophic clustering methods based on similarity measures between SVNSs. First, we define a generalized distance measure between SVNSs and propose (...) two distance-based similarity measures of SVNSs. Then, we present a clustering algorithm based on the similarity measures of SVNSs to cluster single-valued neutrosophic data. Finally, an illustrative example is given to demonstrate the application and effectiveness of the developed clustering methods. (shrink)

On the basis of the combination of single-valued neutrosophic sets and hesitant fuzzy sets, this article proposes a single-valued neutrosophic hesitant fuzzy set as a further generalization of the concepts of fuzzy set, intuitionistic fuzzy set, single-valued neutrosophic set, hesitant fuzzy set, and dual hesitant fuzzy set. Then, we introduce the basic operational relations and cosine measure function of SVNHFSs. Also, we develop a single-valued neutrosophic hesitant fuzzy weighted (...) averaging operator and a single-valued neutrosophic hesitant fuzzy weighted geometric operator and investigate their properties. Furthermore, a multiple-attribute decision-making method is established on the basis of the SVNHFWA and SVNHFWG operators and the cosine measure under a single-valued neutrosophic hesitant fuzzy environment. Finally, an illustrative example of investment alternatives is given to demonstrate the application and effectiveness of the developed approach. (shrink)

Gathering the attitudes of the examined respondents would be very significant in some evaluation models. Therefore, a multiple criteria approach based on the use of the neutrosophic set is considered in this paper. An example of the evaluation of restaurants is considered at the end of this paper with the aim to present in detail the proposed approach.

As a generalization of both single-valued neutrosophic element and hesitant fuzzy element, single-valued neutrosophic hesitant fuzzy element is an efficient tool for describing uncertain and imprecise information. Thus, it is of great significance to deal with single-valued neutrosophic hesitant fuzzy information for many practical problems. In this paper, we study the aggregation of SVNHFEs based on some normalized operations from geometric viewpoint. Firstly, two normalized operations are defined for processing SVNHFEs. Then, (...) a series of normalized aggregation operators which fulfill some basic conditions of a valid aggregation operator are proposed. Additionally, a decision-making method is developed for resolving multiattribute decision-making problems based on the proposed operators. Finally, a numerical example is provided to illustrate the feasibility and effectiveness of the method. (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, medicine, social science, and some more. (shrink)

In this paper, the cosine similarity measure of neutrosophic refined (multi-) sets is proposed and its properties are studied. The concept of this cosine similarity measure of neutrosophic refined sets is the extension of improved cosine similarity measure of single valued neutrosophic. Finally, using this cosine similarity measure of neutrosophic refined set, the application of medical diagnosis is presented.

For each vertex of a simple polygon P an integer valued weight is given. We consider the path p1, p2, ..., pk in P which is created according to the following strategy: p1 is a designated start vertex s and pi+1 is obtained by choosing the vertex with smallest weight among all vertices visible from pi and different from p1, p2, ..., pi. If there is no such vertex the path is finished. This path is called geometric lexicographic dead (...) end path. We shall prove the problem of determining whether a distinguished vertex t of P is on the geometric lexicographic dead end path or not to be P-complete. (shrink)

Cloud computing (ClC) has become a more popular computer paradigm in the preceding few years. Quality of Service (QoS) is becoming a crucial issue in service alteration because of the rapid growth in the number of cloud services. When evaluating cloud service functioning using several performance measures, the issue becomes more complex and non-trivial. It is therefore quite difficult and crucial for consumers to choose the best cloud service. The user's choices are provided in a quantifiable manner in the current (...) methods for choosing cloud services. Hence, this study attempts to achieve this objective through construction. decision-making framework so-called cloud services evaluator (CSsEv). The main indicator and its sub-indicators are formed as nodes at levels(n) in tree soft sets (TSSs). Thereafter Single Value Neutrosophic Sets (SVNSs) as branch of neutrosophic sets which conjunction with the Multi-Criteria Decision Making (MCDM) technique to facilitate analysis and evaluation process for the available Cloud services providers. Hence, entropy is employed to obtain indicators and sub_indicators weights and Complex Proportional Assessment utilizes these weights to facilitate the decision process of selecting optimal ClSPs. (shrink)

In this paper, we introduce the integer programming in neutrosophic environment, by considering coffecients of problem as a triangulare neutrosophic numbers. The degrees of acceptance, indeterminacy and rejection of objectives are simultaneously considered. The Neutrosophic Integer Programming Problem (NIP) is transformed into a crisp programming model, using truth membership (T), indeterminacy membership (I), and falsity membership (F) functions as well as single valued triangular neutrosophic numbers. To measure the efficiency of the model, we solved (...) several numerical examples. (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)

In this paper, one extends the single-valued complex neutrosophic set to the subsetvalued complex neutrosophic set, and afterwards to the subset-valued complex refined neutrosophic set.

Neutrosophic set has been derived from a new branch of philosophy, namely Neutrosophy. Neutrosophic set is capable of dealing with uncertainty, indeterminacy and inconsistent information. Neutrosophic set approaches are suitable to modeling problems with uncertainty, indeterminacy and inconsistent information in which human knowledge is necessary, and human evaluation is needed. Neutrosophic set theory was firstly proposed in 1998 by Florentin Smarandache, who also developed the concept of single valued neutrosophic set, oriented towards real (...) world scientific and engineering applications. Since then, the single valued neutrosophic set theory has been extensively studied in books and monographs, the properties of neutrosophic sets and their applications, by many authors around the world. Also, an international journal - Neutrosophic Sets and Systems started its journey in 2013. Neutrosophic triplet was first defined in 2016 by Florentin Smarandache and Mumtaz Ali and they also introduced the neutrosophic triplet groups in the same year. For every element “x” in a neutrosophic triplet set A, there exist a neutral of “x” and an opposite of “x”. Also, neutral of “x” must be different from the classical neutral element. Therefore, the NT set is different from the classical set. Furthermore, a NT of “x” is showed by . This first volume collects original research and applications from different perspectives covering different areas of neutrosophic studies, such as decision making, Triplet, topology, and some theoretical papers. This volume contains three sections: NEUTROSOPHIC TRIPLET, DECISION MAKING, AND OTHER PAPERS. (shrink)

The n-th PowerSet is used in defining the SuperHyperOperation, SuperHyperAxiom, and their corresponding Neutrosophic SuperHyperOperation, Neutrosophic SuperHyperAxiom in order to build the SuperHyperAlgebra and Neutrosophic SuperHyperAlgebra. In general, in any field of knowledge, one in fact encounters SuperHyperStructures. Also, six new types of topologies have been introduced in the last years (2019-2022), such as: Refined Neutrosophic Topology, Refined Neutrosophic Crisp Topology, NeutroTopology, AntiTopology, SuperHyperTopology, and Neutrosophic SuperHyperTopology. Neutrosophic set has been derived from a (...) new branch of philosophy, namely Neutrosophy. Neutrosophic set is capable of dealing with uncertainty, indeterminacy and inconsistent information. Neutrosophic set approaches are suitable to modeling problems with uncertainty, indeterminacy and inconsistent information in which human knowledge is necessary, and human evaluation is needed. Neutrosophic set theory firstly proposed in 1998 by Florentin Smarandache, who also developed the concept of single valued neutrosophic set, oriented towards real world scientific and engineering applications. Since then, the single valued neutrosophic set theory has been extensively studied in books and monographs introducing neutrosophic sets and its applications, by many authors around the world. Also, an international journal - Neutrosophic Sets and Systems started its journey in 2013. This first volume collects original research and applications from different perspectives covering different areas of neutrosophic studies, such as decision-making, neutroalgebra, neutro metric, and some theoretical papers. (shrink)

Neutrosophic set has been derived from a new branch of philosophy, namely Neutrosophy. Neutrosophic set is capable of dealing with uncertainty, indeterminacy and inconsistent information. Neutrosophic set approaches are suitable to modeling problems with uncertainty, indeterminacy and inconsistent information in which human knowledge is necessary, and human evaluation is needed. Neutrosophic set theory firstly proposed in 1998 by Florentin Smarandache, who also developed the concept of single valued neutrosophic set, oriented towards real world (...) scientific and engineering applications. Since then, the single valued neutrosophic set theory has been extensively studied in books and monographs introducing neutrosophic sets and its applications, by many authors around the world. (shrink)

In this paper, we defined (I,T) − standard neutrosophic rough sets based on an implicator I and a t-norm T on I; lower and upper approximations of standard neutrosophic sets in a standard neutrosophic approximation are defined. Some properties of (I,T) − standard neutrosophic rough sets are investigated. We consider the case when the neutrosophic components (truth, indeterminacy, and falsehood) are totally dependent, single-valued, and hence their sum is ≤ 1.

A graph-theoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as a multi-graph (m-graph) where the nodes and the m-edges include the sorts and the constructors of the signatures at hand. Fibring of two models is a multi-graph (m-graph) where the nodes and the m-edges are the values and the operations in the models, respectively. Fibring of two deductive systems is an (...) m-graph whose nodes are language expressions and the m-edges represent the inference rules of the two original systems. The sobriety of the approach is confirmed by proving that all the fibring notions are universal constructions. This graph-theoretic view is general enough to accommodate very different fibrings of propositional based logics encompassing logics with non-deterministic semantics, logics with an algebraic semantics, logics with partial semantics and substructural logics, among others. Soundness and weak completeness are proved to be preserved under very general conditions. Strong completeness is also shown to be preserved under tighter conditions. In this setting, the collapsing problem appearing in several combinations of logic systems can be avoided. (shrink)

In this paper, we make distinctions between Classical Logic (where the propositions are 100% true, or 100 false) and the Neutrosophic Logic (where one deals with partially true, partially indeterminate and partially false propositions) in order to respond to K. Georgiev’s criticism [1]. We recall that if an axiom is true in a classical logic system, it is not necessarily that the axiom be valid in a modern (fuzzy, intuitionistic fuzzy, neutrosophic etc.) logic system.

We give a new and elementary construction of primitive positive decomposition of higher arity relations into binary relations on finite domains. Such decompositions come up in applications to constraint satisfaction problems, clone theory and relational databases. The construction exploits functional completeness of 2-input functions in many-valued logic by interpreting relations as graphs of partially defined multivalued ‘functions’. The ‘functions’ are then composed from ordinary functions in the usual sense. The construction is computationally effective and relies on well-developed methods (...) of functional decomposition, but reduces relations only to ternary relations. An additional construction then decomposes ternary into binary relations, also effectively, by converting certain disjunctions into existential quantifications. The result gives a uniform proof of Peirce’s reduction thesis on finite domains, and shows that the graph of any Sheffer function composes all relations there. (shrink)

Through their transcript products genes regulate the rates at which an immense variety of transcripts and subsequent proteins occur. Understanding the mechanisms that determine which genes are expressed, and when they are expressed, is one of the keys to genetic manipulation for many purposes, including the development of new treatments for disease. Viewing each gene in a genome as a distinct variable that is either on or off, or more realistically as a continuous variable, the values of some of these (...) variables influence the values of others through the regulatory proteins they express, including, of course, the possibility that the rate of expression of a gene at one time may, in various circumstances, influence the rate of expression of that same gene at a later time. If we imagine an arrow drawn from each gene expression variable at a given time to a gene variable whose expression it influences a short while after, the result is a network, technically a directed acyclic graph. For example, the DAG in Figure 1 is a representation of a system in which the expression level of gene G1 at time 1 ) causes the expression level of G2, which in turn causes the expression level of G3. The arrows in Figure 1 which do not have a variable at their tails are “error terms” which represent all of the causes of a variable other than the ones explicitly represented in the DAG. The DAG describes more than associations—it describes causal connections among gene expression rates. A shock to a cell—by mutation, heating, chemical treatment, etc. may alter the DAG describing the relations among gene expressions, for example by activating a gene that was otherwise not expressed, producing a cascade of new expression effects. Although “knockout” experiments can reveal some of the underlying causal network of gene expression levels, unless guided by information from other sources, such experiments are limited in how much of the network structure they can reveal, due to the sheer number of possible combinations of experimental manipulations of genes necessary to reveal the complete causal network. Recent developments have made it possible to compare quantitatively the expression of tens of thousands of genes in cells from different sources in a single experiment, and to trace gene expression over time in thousands of genes simultaneously. cDNA microarrays are already producing extensive data, much of it available on the web. Thus there are calls for analytic software that can be applied to microarray and other data to help infer regulatory networks. In this paper we will review current techniques that are available for searching for the causal relations between variables, describe algorithmic and data gathering obstacles to applying these techniques to gene expression levels, and describe the prospects for overcoming these obstacles. (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)

We prove frame determination results for the family of many-valued modal logics introduced by M. Fitting in the early '90s. Each modal language of this family is based on a Heyting algebra, which serves as the space of truth values, and is interpreted on an interesting version of possible-worlds semantics: the modal frames are directed graphs whose edges are labelled with an element of the underlying Heyting algebra. We introduce interesting generalized forms of the classical axioms D, T, (...) B, 4, and 5 and prove that they are canonical for certain algebraic frame properties, which generalize seriality, reflexivity, symmetry, transitivity and euclideanness. Our results are quite general as they hold for any modal language built on a complete Heyting algebra. (shrink)

The logic of single-conclusion proofs () is introduced. It combines the verification property of proofs with the single valuedness of proof predicate and describes the operations on proofs induced by modus ponens rule and proof checking. It is proved that is decidable, sound and complete with respect to arithmetical proof interpretations based on single-valued proof predicates. The application to arithmetical inference rules specification and -admissibility testing is considered. We show that the provability in gives the (...) complete admissibility test for the rules which can be specified by schemes in -language. The test is supplied with the ground proof extraction algorithm which eliminates the admissible rules from a -proof by utilizing the information from the corresponding -proofs. (shrink)

We prove frame determination results for the family of many-valued modal logics introduced by M. Fitting in the early '90s. Each modal language of this family is based on a Heyting algebra, which serves as the space of truth values, and is interpreted on an interesting version of possible-worlds semantics: the modal frames are directed graphs whose edges are labelled with an element of the underlying Heyting algebra. We introduce interesting generalized forms of the classical axioms D, T, (...) B, 4, and 5 and prove that they are canonical for certain algebraic frame properties, which generalize seriality, reflexivity, symmetry, transitivity and euclideanness. Our results are quite general as they hold for any modal language built on a complete Heyting algebra. (shrink)

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)

In this paper, we present an expansion of one of the well-known classical inventory management models, which is the static model of inventory management without a deficit and for a single substance, based on the neutrosophic logic, where we provide through this study a basis for dealing with all data, whether specific or undefined in the field of inventory management, as it provides safe environment to manage inventory without running into deficit , and give us an approximate ideal (...) volume of inventory. Since the ideal size is affected by the rate of demand for inventory, we present in this paper a study of the rate of demand for inventory when it is not precisely refined, and we find that the indeterminate values of the demand rate cannot be ignored, because they actually affect determining the ideal size of inventory and calculating its costs, thus affecting on the efficiency of the facility and achieve great profits for it. (shrink)

The claim defended in the paper is that the mechanistic account of explanation can easily embrace idealization in big-scale brain simulations, and that only causally relevant detail should be present in explanatory models. The claim is illustrated with two methodologically different models: Blue Brain, used for particular simulations of the cortical column in hybrid models, and Eliasmith’s SPAUN model that is both biologically realistic and able to explain eight different tasks. By drawing on the mechanistic theory of computational explanation, I (...) argue that large-scale simulations require that the explanandum phenomenon is identified; otherwise, the explanatory value of such explanations is difficult to establish, and testing the model empirically by comparing its behavior with the explanandum remains practically impossible. The completeness of the explanation, and hence of the explanatory value of the explanatory model, is to be assessed vis-à-vis the explanandum phenomenon, which is not to be conflated with raw observational data and may be idealized. I argue that idealizations, which include building models of a single phenomenon displayed by multi-functional mechanisms, lumping together multiple factors in a single causal variable, simplifying the causal structure of the mechanisms, and multi-model integration, are indispensable for complex systems such as brains; otherwise, the model may be as complex as the explanandum phenomenon, which would make it prone to so-called Bonini paradox. I conclude by enumerating dimensions of empirical validation of explanatory models according to new mechanism, which are given in a form of a “checklist” for a modeler. (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, medicine, social science, and some more. (shrink)

When we discuss the value of a work of art we are confronted immediately with two difficulties: the terms we use, and the peculiar character of art. No one, to my knowledge, has ever doubted that an artist produces a form of some kind, and that in any discussion of art as art that form must somehow be considered; but the terms we use generally have no reference to form. We miss the form in various ways We use terms that (...) are nonartistic—that is, terms that refer to something external to the work, as when we speak of the subject of a painting, of what was depicted rather than the depiction of it, though we know full well that what we respond to is not what was depicted but the depiction of it. "This is a play about Oedipus— what does that tell us of the diverse forms produced by Sophocles, Seneca, Dryden, Voltaire, Gide, Cocteau? Or again, we use terms which are analogical, for example, the "rhythm" of a painting; the difficulty with these is that they are ambiguous and also that, while they may relate to the work, they can designate it only insofar as there is similarity between it and the analogue. Again, we use terms which seem to designate a single form when in fact they refer to forms of the utmost heterogeneity, as when we speak of "the novel"; this usually arises out of the indiscriminate application of the term over some considerable span of history, so that the "historical slippage" of meaning is gradual and goes unnoticed. As the term broadens in meaning to include more and more heterogeneous forms, the essence of each is lost, and the term comes to apply only to accidental analogies between the forms. In the end very little can then be said, involving only the most abstract and general accidents of likeness. Henry James' The Art of Fiction, Percy Lubbock's The Craft of Fiction, and E.M. Forster's Aspects of the Novel illustrate this condition perfectly. The complaint that it is impossible to discuss tragedy because the term has been diversely employed and its proffered justification stem from this condition. The complaint and the justifications are both trivial, and the solution of the difficulty is simple. All that is necessary is to distinguish the different senses of the term by distinguishing the different things to which it is applied. Language is ambiguous, and we use it ambiguously; this in no way implies that the ambiguities cannot be cleared up. Finally, we may use terms which indeed have reference to the form of the work but place the part for the whole; that is, terms which are elements in its definition but do not constitute the complete definition. Thus we designate something, not through the form proper but through the device or method used, as in "drama," "sculpture," "etching," "collage," or through the means or medium, as in "charcoal sketch," "watercolor," "oil painting." The point is not that the object is not, say, a drama or a watercolor; of course it is. The point is rather that these terms do not as such refer to the form and refer to it completely. If in fact they stipulated form, all charcoal sketches would be alike in form, and all oil paintings, and all dramas. One consequence of speaking in such a fashion is that we are likely to confuse the method with the form and talk of, say, "the nature of drama" as though all drama were of the same "nature," whereas the dramatic method is used in a wide variety of forms; or to confuse the medium or means with the form and to assure that the work can have no properties beyond those of its medium, as though artists did not exist and all art were simply nature.Elder Olson, poet and critic, has received numerous awards for his verse . Among his many works are Tragedy and the Theory of Drama, and The Theory of Comedy. His contributions to Critical Inquiry are "The Poetic Process"" , Part 1 of a "Conspectus of Poetry", and Part 2 of a "Conspectus of Poetry". (shrink)

-/- Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) to various natural classes of complete metric structures (such as probability algebras, Hilbert spaces, and Banach spaces). With research in continuous first-order logic preoccupied with studying the model theory of this framework, we find a natural question calls for attention. Is there an interesting set of axioms yielding a completeness result? -/- The (...) primary purpose of this article is to show that a certain, interesting set of axioms does indeed yield a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely) satisfiable if (and only if) it is consistent. From this result it follows that continuous first-order logic also satisfies an approximated form of strong completeness, whereby Σ⊧φ (if and) only if Σ⊢φ ∸2−n for all n < ω. This approximated form of strong completeness asserts that if Σ⊧φ, then proofs from Σ, being finite, can provide arbitrarily better approximations of the truth of φ. -/- Additionally, we consider a different kind of question traditionally arising in model theory—that of decidability. When is the set of all consequences of a theory (in a countable, recursive language) recursive? Say that a complete theory T is decidable if for every sentence φ, the value φ T is a recursive real, and moreover, uniformly computable from φ. If T is incomplete, we say it is decidable if for every sentence φ the real number φ T o is uniformly recursive from φ, where φ T o is the maximal value of φ consistent with T. As in classical first-order logic, it follows from the completeness theorem of continuous first-order logic that if a complete theory admits a recursive (or even recursively enumerable) axiomatization then it is decidable. (shrink)

I apply Kooi and Tamminga's (2012) idea of correspondence analysis for many-valued logics to strong three-valued logic (K3). First, I characterize each possible single entry in the truth-table of a unary or a binary truth-functional operator that could be added to K3 by a basic inference scheme. Second, I define a class of natural deduction systems on the basis of these characterizing basic inference schemes and a natural deduction system for K3. Third, I show that each of (...) the resulting natural deduction systems is sound and complete with respect to its particular semantics. Among other things, I thus obtain a new proof system for Lukasiewicz's three-valued logic. (shrink)