The concept of fuzzy Galois connections is defined on fuzzy posets with Bělohlávek's fuzzy Galois connections as a special case. The properties of fuzzy Galois connections are investigated. Then the relations between fuzzy Galois connections and fuzzy closure operators, fuzzy interior operators are studied.

In this paper, by using the notion of fuzzy points and equality algebras, the notions of fuzzy point equality algebra, equality-subalgebra, and ideal were established. Some characterizations of fuzzy subalgebras were provided by using such concepts. We defined the concepts of \((\in, \in)\) and \((\in, \in\! \vee \, {q})\)-fuzzy ideals of equality algebras, discussed some properties, and found some equivalent definitions of them. In addition, we investigated the relation between different kinds of \((\alpha,\beta)\)-fuzzy subalgebras and (...) \((\alpha,\beta)\)-fuzzy ideals on equality algebras. Also, by using the notion of \((\in, \in)\)-fuzzy ideal, we defined two equivalence relations on equality algebras and we introduced an order on classes of \(X\), and we proved that the set of all classes of \(X\) by these order is a poset. (shrink)

Two different generalizations of Brouwer–Zadeh posets (BZ posets) are introduced. The former (called pre-BZ poset) arises from topological spaces, whose standard power set orthocomplemented complete atomic lattice can be enriched by another complementation associating with any subset the set theoretical complement of its topological closure. This complementation satisfies only some properties of the algebraic version of an intuitionistic negation, and can be considered as, a generalized form of a Brouwer negation. The latter (called degenerate BZ poset) arises from (...) the so-called special effects on a Hilbert space. It is shown that the standard Brouwer negation for effect operators produces a degenerate BZ poset with respect to the order induced from the partial sum operation. (shrink)

It, is shown that Birkhoff –von Neumann quantum logic (i.e., an orthomodular lattice or poset) possessing an ordering set of probability measures S can be isomorphically represented as a family of fuzzy subsets of S or, equivalently, as a family of propositional functions with arguments ranging over S and belonging to the domain of infinite-valued Łukasiewicz logic. This representation endows BvN quantum logic with a new pair of partially defined binary operations, different from the order-theoretic ones: Łukasiewicz intersection (...) and union of fuzzy sets in the first case and Łukasiewicz conjunction and disjunction in the second. Relations between old and new operations are studied and it is shown that although they coincide whenever new operations are defined, they are not identical in general. The hypothesis that quantum-logical conjunction and disjunction should be represented by Łukasiewicz operations, not by order-theoretic join and meet is formulated and some of its possible consequences are considered. (shrink)

On the basis of Mackey's axiomatic approach to quantum physics or, equivalently, of a “state-event-probability” (SEVP) structure, using a quite standard “fuzzification” procedure, a set of unsharp events (or “effects”) is constructed and the corresponding “state-effect-probability” (SEFP) structure is introduced. The introduction of some suitable axioms gives rise to a partially ordered structure of quantum Brouwer-Zadeh (BZ) poset; i.e., a poset endowed with two nonusual orthocomplementation mappings, a fuzzy-like orthocomplementation, and an intuitionistic-like orthocomplementation, whose set of sharp (...) elements is an orthomodular complete lattice. As customary, by these orthocomplementations the two modal-like necessity and possibility operators are introduced, and it is shown that Ludwig's and Jauch-Piron's approaches to quantum physics are “interpreted” in complete SEFP. As a marginal result, a standard procedure to construct a lot of unsharp realizations starting from any sharp realization of a fixed observable is given, and the relationship among sharp and corresponding unsharp realizations is studied. (shrink)

We introduce a new theorem in social choice theory built on a path integral approach which will show that, under some reasonable conditions, there is a unique way to aggregate individual preferences based on fuzzy sets into a social preference based on probabilities, and that this way is invariant under any permutation of alternatives. We then apply this theorem to the case of democratic decision making with data of the behaviour and voting preferences of voting agents and show that (...) there is a tradeoff between fairness and efficiency and that no voting system can achieve both simultaneously. (shrink)

A notion of interpretation between arbitrary logics is introduced, and the poset$\mathsf {Log}$of all logics ordered under interpretability is studied. It is shown that in$\mathsf {Log}$infima of arbitrarily large sets exist, but binary suprema in general do not. On the other hand, the existence of suprema of sets of equivalential logics is established. The relations between$\mathsf {Log}$and the lattice of interpretability types of varieties are investigated.

Although Fuzzy logic and Fuzzy Mathematics is a widespread subject and there is a vast literature about it, yet the use of Fuzzy issues like Fuzzy sets and Fuzzy numbers was relatively rare in time concept. This could be seen in the Fuzzy time series. In addition, some attempts are done in fuzzing Turing Machines but seemingly there is no need to fuzzy time. Throughout this article, we try to change this picture and (...) show why it is helpful to consider the instants of time as Fuzzy numbers. In physics, though there are revolutionary ideas on the time concept like B theories in contrast to A theory also about central concepts like space, momentum… it is a long time that these concepts are changed, but time is considered classically in all well-known and established physics theories. Seemingly, we stick to the classical time concept in all fields of science and we have a vast inertia to change it. Our goal in this article is to provide some bases why it is rational and reasonable to change and modify this picture. Here, the central point is the modified version of “Unexpected Hanging” paradox as it is described in "Is classical Mathematics appropriate for theory of Computation".This modified version leads us to a contradiction and based on that it is presented there why some problems in Theory of Computation are not solved yet. To resolve the difficulties arising there, we have two choices. Either “choosing” a new type of Logic like “Para-consistent Logic” to tolerate contradiction or changing and improving the time concept and consequently to modify the “Turing Computational Model”. Throughout this paper, we select the second way for benefiting from saving some aspects of Classical Logic. In chapter 2, by applying quantum Mechanics and Schrodinger equation we compute the associated fuzzy number to time. (shrink)

We prove that the poset algebra of every scattered poset with finite width is embeddable in the poset algebra of a well ordered poset.

We develop the theory of layered posets and use the notion of layering to prove a new iteration theorem is κ-cc, as long as direct limits are used sufficiently often. This iteration theorem simplifies and generalizes the various chain condition arguments for universal Kunen iterations in the literature on saturated ideals, especially in situations where finite support iterations are not possible. We also provide two applications:1 For any n≥1, a wide variety of <ωn−1-closed, ωn+1-cc posets of size ωn+1 can consistently (...) be absorbed by quotients of saturated ideals on ωn.2 For any n∈ω, the tree property at ωn+3 is consistent with Chang’s conjecture ↠. (shrink)

We introduce a relational semantics based on poset products, and provide sufficient conditions guaranteeing its soundness and completeness for various substructural logics. We also demonstrate that our relational semantics unifies and generalizes two semantics already appearing in the literature: Aguzzoli, Bianchi, and Marra’s temporal flow semantics for Hájek’s basic logic, and Lewis-Smith, Oliva, and Robinson’s semantics for intuitionistic Łukasiewicz logic. As a consequence of our general theory, we recover the soundness and completeness results of these prior studies in a (...) uniform fashion, and extend them to infinitely-many other substructural logics. (shrink)

We show that the separative quotient of the poset 〈P,⊂〉 of isomorphic suborders of a countable scattered linear order L is σ-closed and atomless. So, under the CH, all these posets are forcing-equivalent /Fin)+).

A Leibniz class is a class of logics closed under the formation of term-equivalent logics, compatible expansions, and non-indexed products of sets of logics. We study the complete lattice of all Leibniz classes, called the Leibniz hierarchy. In particular, it is proved that the classes of truth-equational and assertional logics are meet-prime in the Leibniz hierarchy, while the classes of protoalgebraic and equivalential logics are meet-reducible. However, the last two classes are shown to be determined by Leibniz conditions consisting of (...) meet-prime logics only. (shrink)

Although machine intelligence is increasingly employed in healthcare, the realm of decision-making in medical ethics remains largely unexplored from a technical perspective. We propose an approach based on fuzzy cognitive maps (FCMs), which builds on Beauchamp and Childress’ prima-facie principles. The FCM’s weights are optimized using a genetic algorithm to provide recommendations regarding the initiation, continuation, or withdrawal of medical treatment. The resulting model approximates the answers provided by our team of medical ethicists fairly well and offers a high (...) degree of interpretability. Possible applications of such a system include informal guidance on medical ethics dilemmas as well as educational purposes. (shrink)

Shared conceptualization, in the sense we take it here, is as recent a notion as the Semantic Web, but its relevance for a large variety of fields requires efficient methods of extraction and representation for both quantitative and qualitative data. This notion is particularly relevant for the investigation into, and construction of, semantic structures such as knowledge bases and taxonomies, but given the required large, often inaccurate, corpora available for search we can get only approximations. We see fuzzy description (...) logic as an adequate medium for the representation of human semantic knowledge and propose a means to couple it with fuzzy semantic networks via the propositional Łukasiewicz fuzzy logic such that these suffice for decidability for queries over a semantic-knowledge base such as “to what degree of sharedness does it entail the instantiation C(a) for some concept C” or “what are the roles R that connect the individuals a and b to degree of sharedness ε.” . (shrink)

The concept of Galois connection between power sets is generalized from the point of view of fuzzy logic. Studied is the case where the structure of truth values forms a complete residuated lattice. It is proved that fuzzy Galois connections are in one-to-one correspondence with binary fuzzy relations. A representation of fuzzy Galois connections by Galois connections is provided.

We explore the problem of constructing maximal and unbounded filters on computable posets. We obtain both computability results and reverse mathematics results. A maximal filter is one that does not extend to a larger filter. We show that every computable poset has a \Delta^0_2 maximal filter, and there is a computable poset with no \Pi^0_1 or \Sigma^0_1 maximal filter. There is a computable poset on which every maximal filter is Turing complete. We obtain the reverse mathematics result (...) that the principle "every countable poset has a maximal filter" is equivalent to ACA₀ over RCA₀. An unbounded filter is a filter which achieves each of its lower bounds in the poset. We show that every computable poset has a \Sigma^0_1 unbounded filter, and there is a computable poset with no \Pi^0_1 unbounded filter. We show that there is a computable poset on which every unbounded filter is Turing complete, and the principle "every countable poset has an unbounded filter" is equivalent to ACA₀ over RCA₀. We obtain additional reverse mathematics results related to extending arbitrary filters to unbounded filters and forming the upward closures of subsets of computable posets. (shrink)

The term "fuzzy logic," as it is understood in this book, stands for all aspects of representing and manipulating knowledge based on the rejection of the most fundamental principle of classical logic---the principle of bivalence. According to this principle, each declarative sentence is required to be either true or false. In fuzzy logic, these classical truth values are not abandoned. However, additional, intermediate truth values between true and false are allowed, which are interpreted as degrees of truth. This (...) opens a new way of thinking---thinking in terms of degrees rather than absolutes. For example, it leads to the definition of a new kind of sets, referred to as fuzzy sets, in which membership is a matter of degree. The book examines the genesis and development of fuzzy logic. It surveys the prehistory of fuzzy logic and inspects circumstances that eventually lead to the emergence of fuzzy logic. The book explores in detail the development of propositional, predicate, and other calculi that admit degrees of truth, which are known as fuzzy logic in the narrow sense. Fuzzy logic in the broad sense, whose primary aim is to utilize degrees of truth for emulating common-sense human reasoning in natural language, is scrutinized as well. The book also examines principles for developing mathematics based on fuzzy logic and provides overviews of areas in which this has been done most effectively. It also presents a detailed survey of established and prospective applications of fuzzy logic in various areas of human affairs, and provides an assessment of the significance of fuzzy logic as a new paradigm. (shrink)

Standard models of adolescent risk taking posit that the cognitive abilities of adolescents and adults are equivalent, and that increases in risk taking that occur during adolescence are the result of socio emotional differences in impulsivity, sensation seeking, and lack of self-control. Fuzzy-trace theory incorporates these socio emotional differences. However, it predicts that there are also cognitive differences between adolescents and adults, specifically that there are developmental increases in gist-based intuition that reflects understanding. Gist understanding, as opposed to verbatim-based (...) analysis, generally has been hypothesized to have a protective effect on risk taking in adolescence. Gist understanding is also an essential element of informed consent regarding risks in medical decision- making. Evidence thus supports the argument that adolescents’ status as mature minors should be treated as an exception rather than a presumption, because accuracy in verbatim analysis is not mature gist understanding. Use of the exception should be accompanied by medical experts’ input on the bottom-line gist of risks involved in treatment. (shrink)

A logic in a finite language is said to be finitely presentable if it is axiomatized by finitely many finite rules. It is proved that binary non-indexed products of logics that are both finitely presentable and finitely equivalential are essentially finitely presentable. This result does not extend to binary non-indexed products of arbitrary finitely presentable logics, as shown by a counterexample. Finitely presentable logics are then exploited to introduce finitely presentable Leibniz classes, and to draw a parallel between the Leibniz (...) and the Maltsev hierarchies. (shrink)

The paper presents generalizations of results on so-called Horn logic, well-known in universal algebra, to the setting of fuzzy logic. The theories we consider consist of formulas which are implications between identities (equations) with premises weighted by truth degrees. We adopt Pavelka style: theories are fuzzy sets of formulas and we consider degrees of provability of formulas from theories. Our basic structure of truth degrees is a complete residuated lattice. We derive a Pavelka-style completeness theorem (degree of provability (...) equals degree of truth) from which we get some particular cases by imposing restrictions on the formulas under consideration. As a particular case, we obtain completeness of fuzzy equational logic. (shrink)

This hands-on guide offers clear explanations of fuzzy logic along with practical uses and detailed examples. Written by an award-winning engineer and experienced author, Fuzzy Logic: Applications in Artificial Intelligence, Big Data, and Machine Learning is aimed at improving competence and skills in students and professionals alike. Inside, you will discover how to apply fuzzy logic and migrate to a new man-machine relationship in the context of pervasive digitization and big data across emerging technologies. The book lays (...) out real-world applications in intelligent energy systems with demand response, smart homes, electrification of transportation, supply chain efficiencies, smart cities, e-commerce, education, healthcare, and decarbonization. (shrink)

The paper studies closure properties of classes of fuzzy structures defined by fuzzy implicational theories, i.e. theories whose formulas are implications between fuzzy identities. We present generalizations of results from the bivalent case. Namely, we characterize model classes of general implicational theories, finitary implicational theories, and Horn theories by means of closedness under suitable algebraic constructions.

Fuzzy intuitionistic quantum logics (called also Brouwer-Zadeh logics) represent to non standard version of quantum logic where the connective not is split into two different negation: a fuzzy-like negation that gives rise to a paraconsistent behavior and an intuitionistic-like negation. A completeness theorem for a particular form of Brouwer-Zadeh logic (BZL 3) is proved. A phisical interpretation of these logics can be constructed in the framework of the unsharp approach to quantum theory.

Residuated fuzzy logic calculi are related to continuous t-norms, which are used as truth functions for conjunction, and their residua as truth functions for implication. In these logics, a negation is also definable from the implication and the truth constant $\overline{0}$ , namely $\neg \varphi$ is $\varphi \to \overline{0}$. However, this negation behaves quite differently depending on the t-norm. For a nilpotent t-norm (a t-norm which is isomorphic to Łukasiewicz t-norm), it turns out that $\neg$ is an involutive negation. (...) However, for t-norms without non-trivial zero divisors, $\neg$ is Gödel negation. In this paper we investigate the residuated fuzzy logics arising from continuous t-norms without non-trivial zero divisors and extended with an involutive negation. (shrink)

The notions of health, illness, and disease are fuzzy-theoretically analyzed. They present themselves as non-Aristotelian concepts violating basic principles of classical logic. A recursive scheme for defining the controversial notion of disease is proposed that also supports a concept of fuzzy disease. A sketch is given of the prototype resemblance theory of disease.

The aim of this paper is to make a proposal for a new extension of the MULTIMOORA method extended to deal with bipolar fuzzy sets. Bipolar fuzzy sets are proposed as an extension of classical fuzzy sets in order to enable solving a particular class of decision-making problems. Unlike other extensions of the fuzzy set of theory, bipolar fuzzy sets introduce a positive membership function, which denotes the satisfaction degree of the element x to the (...) property corresponding to the bipolar-valued fuzzy set, and the negative membership function, which denotes the degree of the satisfaction of the element x to some implicit counter-property corresponding to the bipolar-valued fuzzy set. By using single-valued bipolar fuzzy numbers, the MULTIMOORA method can be more efficient for solving some specific problems whose solving requires assessment and prediction. The suitability of the proposed approach is presented through an example. (shrink)

Although Fuzzy logic and Fuzzy Mathematics is a widespread subject and there is a vast literature about it, yet the use of Fuzzy issues like Fuzzy sets and Fuzzy numbers was relatively rare in time concept. This could be seen in the Fuzzy time series. In addition, some attempts are done in fuzzing Turing Machines but seemingly there is no need to fuzzy time. Throughout this article, we try to change this picture and (...) show why it is helpful to consider the instants of time as Fuzzy numbers. In physics, though there are revolutionary ideas on the time concept like B theories in contrast to A theory also about central concepts like space, momentum… it is a long time that these concepts are changed, but time is considered classically in all well-known and established physics theories. Seemingly, we stick to the classical time concept in all fields of science and we have a vast inertia to change it. Our goal in this article is to provide some bases why it is rational and reasonable to change and modify this picture. Here, the central point is the modified version of “Unexpected Hanging” paradox as it is described in "Is classical Mathematics appropriate for theory of Computation".This modified version leads us to a contradiction and based on that it is presented there why some problems in Theory of Computation are not solved yet. To resolve the difficulties arising there, we have two choices. Either “choosing” a new type of Logic like “Para-consistent Logic” to tolerate contradiction or changing and improving the time concept and consequently to modify the “Turing Computational Model”. Throughout this paper, we select the second way for benefiting from saving some aspects of Classical Logic. In chapter 2, by applying quantum Mechanics and Schrodinger equation we compute the associated fuzzy number to time. These, provides a new interpretation of Quantum Mechanics.More exactly what we see here is "Particle-Fuzzy time" interpretation of quantum Mechanics, in contrast to some other interpretations of Quantum Mechanics like " Wave-Particle" interpretation. At the end, we propound a question about the possible solution of a paradox in Physics, the contradiction between General Relativity and Quantum Mechanics. (shrink)

Substructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0.1]. In this paper, we introduce Uninorm logic UL as Multiplicative additive intuitionistic linear logic MAILL extended with the prelinearity axiom ((A → B) ∧ t) ∨ ((B → A) ∧ t). Axiomatic extensions of UL include known fuzzy logics such as Monoidal t-norm logic MTL and Gödel logic G, and new weakening-free logics. Algebraic semantics for these (...) logics are provided by subvarieties of (representable) pointed bounded commutative residuated lattices. Gentzen systems admitting cut-elimination are given in the framework of hypersequents. Completeness with respect to algebras with lattice reduct [0, 1] is established for UL and several extensions using a two-part strategy. First, completeness is proved for the logic extended with Takeuti and Titani's density rule. A syntactic elimination of the rule is then given using a hypersequent calculus. As an algebraic corollary, it follows that certain varieties of residuated lattices are generated by their members with lattice reduct [0, 1]. (shrink)

Although Fuzzy logic and Fuzzy Mathematics is a widespread subject and there is a vast literature about it, yet the use of Fuzzy issues like Fuzzy sets and Fuzzy numbers was relatively rare in time concept. This could be seen in the Fuzzy time series. In addition, some attempts are done in fuzzing Turing Machines but seemingly there is no need to fuzzy time. Throughout this article, we try to change this picture and (...) show why it is helpful to consider the instants of time as Fuzzy numbers. In physics, though there are revolutionary ideas on the time concept like B theories in contrast to A theory also about central concepts like space, momentum… it is a long time that these concepts are changed, but time is considered classically in all well-known and established physics theories. Seemingly, we stick to the classical time concept in all fields of science and we have a vast inertia to change it. Our goal in this article is to provide some bases why it is rational and reasonable to change and modify this picture. Here, the central point is the modified version of “Unexpected Hanging” paradox as it is described in "Is classical Mathematics appropriate for theory of Computation".This modified version leads us to a contradiction and based on that it is presented there why some problems in Theory of Computation are not solved yet. To resolve the difficulties arising there, we have two choices. Either “choosing” a new type of Logic like “Para-consistent Logic” to tolerate contradiction or changing and improving the time concept and consequently to modify the “Turing Computational Model”. Throughout this paper, we select the second way for benefiting from saving some aspects of Classical Logic. In chapter 2, by applying quantum Mechanics and Schrodinger equation we compute the associated fuzzy number to time. These, provides a new interpretation of Quantum Mechanics.More exactly what we see here is "Particle-Fuzzy time" interpretation of quantum Mechanics, in contrast to some other interpretations of Quantum Mechanics like " Wave-Particle" interpretation. At the end, we propound a question about the possible solution of a paradox in Physics, the contradiction between General Relativity and Quantum Mechanics. (shrink)

Presented is a completeness theorem for fuzzy equational logic with truth values in a complete residuated lattice: Given a fuzzy set Σ of identities and an identity p≈q, the degree to which p≈q syntactically follows (is provable) from Σ equals the degree to which p≈q semantically follows from Σ. Pavelka style generalization of well-known Birkhoff's theorem is therefore established.

This book brings together classic and recent papers in the philosophical and linguistic analysis of fuzzy grammar, gradience in meaning, word classes, and syntax. Issues such as how many grains make a heap, when a puddle becomes a pond, and so forth, have occupied thinkers since Aristotle and over the last two decades been the subject of increasing interest among linguists as well as in fields such as artificial intelligence and computational linguistics. The work is designed to be of (...) use to students in all these fields. It has a substantial introduction, is divided into thematic parts, contains annotated sections of further reading, and is fully indexed. (shrink)

Different constructions of BL-chains are compared. We establish when the ordinal sum and the poset product of the same family of BL-chains coincide. We also compare the poset product of MV-chains and product chains with saturated BL-chains.

The major point in [1] chapter 2 is the following claim: “Any formalized system for the Theory of Computation based on Classical Logic and Turing Model of Computation leads us to a contradiction.” So, in the case we wish to save Classical Logic we should change our Computational Model. As we see in chapter two, the mentioned contradiction is about and around the concept of time, as it is in the contradiction of modified version of paradox. It is natural to (...) try fabricating the paradox not by time but in some other linear ordering or the concept of space. Interestingly, the attempts to have similar contradiction by the other concepts like space and linear ordering, is failed. It is remarkable that, the paradox is considered either Epistemological or Logical traditionally, but by new considerations the new version of paradox should be considered as either Logical or Physical paradox. Hence, in order to change our Computational Model, it is natural to change the concept of time, but how? We start from some models that are different from the classical one but they are intuitively plausible. The idea of model is somewhat introduced by Brouwer and Husserl [3]. This model doesn’t refute the paradox, since the paradox and the associated contradiction would be repeated in this new model. The model is introduced in [2]. Here we give some more explanations. (shrink)

A novel fuzzy control scheme with adaptation algorithms is developed for robot manipulators’ system. At the beginning, one adjustable parameter is introduced in the fuzzy logic system, the robot manipulators system with uncertain nonlinear terms as the master device and a reference model dynamic system as the slave robot system. To overcome the limitations such as online learning computation burden and logic structure in conventional fuzzy logic systems, a parameter should be used in fuzzy logic system, (...) which composes fuzzy logic system with updated parameter laws, and can be formed for a new fashioned adaptation algorithms controller. The error closed-loop dynamical system can be stabilized based on Lyapunov analysis, the number of online learning computation burdens can be reduced greatly, and the different kinds of fuzzy logic systems with fuzzy rules or without any fuzzy rules are also suited. Finally, effectiveness of the proposed approach has been shown in simulation example. (shrink)

This unique compendium presents a comprehensive and self-contained theory of material development under imperfect information and its applications. The book describes new approaches to synthesis and selection of materials with desirable characteristics. Such approaches provide the ability of systematic and computationally effective analysis in order to predict composition, structure and related properties of new materials. The volume will be a useful advanced textbook for graduate students. It is also suitable for academicians and practitioners who wish to have fundamental models in (...) new material synthesis and selection. (shrink)

The history of Fuzziness in Italy is varied and scattered among a num- ber of research groups. As a matter of fact, “fuzziness” spread in Italy through a sort of spontaneous diffusion, and, also subsequently, no one felt the need to cre- ate some “national” common structure like an Association or similar things. Since a cohesive retelling would be next to impossible, a few members of the Italian fuzzy community have been asked to recount their experience and express their (...) hopes for the future. (shrink)

It seems clear that second order fuzziness (indeterminacy) is possible. There can be borderline cases of borderline cases. But how about third order cases? Is there no end of degrees of borderlinehood? I offer a somewhat strange little 'language game' that seems to suggest that the ascension ends with second order cases. (The 'game' is intended to be somewhat like a simplified version of color perception.).

The term fuzzy logic is used in this paper to describe an imprecise logical system, FL, in which the truth-values are fuzzy subsets of the unit interval with linguistic labels such as true, false, not true, very true, quite true, not very true and not very false, etc. The truth-value set, , of FL is assumed to be generated by a context-free grammar, with a semantic rule providing a means of computing the meaning of each linguistic truth-value in (...) as a fuzzy subset of [0, 1].Since is not closed under the operations of negation, conjunction, disjunction and implication, the result of an operation on truth-values in requires, in general, a linguistic approximation by a truth-value in . As a consequence, the truth tables and the rules of inference in fuzzy logic are (i) inexact and (ii) dependent on the meaning associated with the primary truth-value true as well as the modifiers very, quite, more or less, etc. (shrink)

A clear account of the principles of fuzzy logic-based design, from a computer/electronics engineering perspective. This pedagogical work incorporates current fuzzy logic techniques, emphasizing hardware/software design for fuzzy systems and fuzzy logic development tools.

Fuzzy logic is understood as a logic with a comparative and truth-functional notion of truth. Arithmetical complexity of sets of tautologies and satisfiable sentences as well of sets of provable formulas of the most important systems of fuzzy predicate logic is determined or at least estimated.

This simulation study is a fuzzy model-based neural network control method. The basic idea is to consider the application of a special type of neural networks based on radial basis function, which belongs to a class of associative memory neural networks. The novelty of this approach is the use of an RBF neural network controller in a model reference adaptive control architecture, based on a one-step-ahead Takagi–Sugeno fuzzy model. The objective is to control the concentration in a continuous (...) stirred-tank reactor highly non-linear system and to assure its stability by limiting the temperature rise generated from the irreversible exothermic reaction. This contribution will help to reduce environmental impact of chemical waste. (shrink)

In empiricism, there are only two answers for a question: black or white. Yet, subjective meanings of human behaviours and responses toward health and illness cannot be simply explained with black and white. Gray zones are needed because they are characterized by complexity and require a contextual understanding. In this paper, we present and suggest fuzzy logic as an example of theoretical bases that help transcend the conflicts between objectivity and subjectivity, respect gray zones between black and white answers (...) for questions, and provide a contextual understanding of complex nursing phenomenon. A historical review of fuzzy logic is followed by a definition of fuzzy logic. Then, fuzzy logic is discussed in terms of its compatibility with nursing epistemological views and philosophical thoughts. Fuzzy logic agrees with three categories of epistemological views of nursing, including correspondence, coherence and pragmatism. Fuzzy logic also agrees with four major philosophical thoughts in nursing, including postempiricism, pragmatism, feminism, and postmodernism. Based on the discussion, we propose that fuzzy logic be further explored, used and developed in research and practice in the nursing areas/situations/phenomena that are characterized by complexity, ambiguousness, and vagueness. (shrink)

Recently, a new movement has arisen in the philosophy of perception: one that views perception as a natural kind. Strangely, this movement has neglected the extensive work in philosophy of science on natural kinds. The present paper remedies this. I start by isolating a widespread and influential assumption, which is that we can give necessary and sufficient conditions for perception. I show that this assumption is radically at odds with current philosophy of science work on natural kinds. I then develop (...) an alternative, new view of perception. This new view takes as its starting point the dominant position on kinds in the life sciences: the homeostatic property cluster account. I show that, if you accept this view, then all of the putative cases of unconscious perception are more plausibly seen as cases where it is indeterminate whether the mental episode in question is an instance of perception. (shrink)

In many applications we have a set of objects together with their properties. Since the available information is usually incomplete and/or imprecise, the true knowledge about subsets of objects can be determined approximately only. In this paper, we discuss a fuzzy generalisation of two pairs of relation-based operators suitable for fuzzy set approximations, which have been recently investigated by Düntsch and Gediga. Double residuated lattices, introduced by Orlowska and Radzikowska, are taken as basic algebraic structures. Main properties of (...) these operators are presented. (shrink)

The concept of supermatrix for social scientists was first introduced by Paul Horst. The main purpose of his book was to introduce this concept to social scientists, students, teachers and research workers who lacked mathematical training. This book introduces the concept of fuzzy super matrices and operations on them. The author has provided only those operations on fuzzy supermatrices that are essential for developing super fuzzy multi expert models. This book will be highly useful to social scientists (...) who wish to work with multi expert models. (shrink)