This paper is a contribution to the development of model theory of fuzzy logic in narrow sense. We consider a formal system EvŁ of fuzzy logic that has evaluated syntax, i. e. axioms need not be fully convincing and so, they form a fuzzy set only. Consequently, formulas are provable in some general degree. A generalization of Gödel's completeness theorem does hold in EvŁ. The truth values form an MV-algebra that is either finite (...) or Łukasiewicz algebra on [0, 1].The classical omitting types theorem states that given a formal theory T and a set Σ of formulas with the same free variables, we can construct a model of T which omits Σ, i. e. there is always a formula from Σ not true in it. In this paper, we generalize this theorem for EvŁ, that is, we prove that if T is a fuzzy theory and Σ forms a fuzzy set , then a model omitting Σ also exists. We will prove this theorem for two essential cases of EvŁ: either EvŁ has logical constants for all truth values, or it has these constants for truth values from [0, 1] ∩ ℚ only. (shrink)

The paper deals with fuzzy Horn logic which is a fragment of predicate fuzzy logic with evaluated syntax. Formulas of FHL are of the form of simple implications between identities. We show that one can have Pavelka-style completeness of FHL w.r.t. semantics over the unit interval [0, 1] with left-continuous t-norm and a residuated implication, provided that only certain fuzzy sets of formulas are considered. The model classes of fuzzy (...) structures of FHL are characterized by closure properties. We also give comments on related topics proposed by N. Weaver. (shrink)

This paper is a contribution to the development of fuzzy logic in narrow sense with evaluated syntax and connectives interpreted in Łukasiewicz algebra. The main results concern model theory of fuzzy logic and generalization of the Craig-Robinson's theorem on joint consistency of fuzzy theories as well as Craig's interpolation theorem.

Many results in fuzzy logic depend on the mathematical structure the truth value set obeys. In this textbook the algebraic foundations of many-valued and fuzzy reasoning are introduced. The book is self-contained, thus no previous knowledge in algebra or in logic is required. It contains 134 exercises with complete answers, and can therefore be used as teaching material at universities for both undergraduated and post-graduated courses. Chapter 1 starts from such basic concepts as order, lattice, (...) equivalence and residuated lattice. It contains a full section on BL-algebras. Chapter 2 concerns MV-algebra and its basic properties. Chapter 3 applies these mathematical results on Lukasiewicz-Pavelka style fuzzy logic, which is studied in details; besides semantics, syntax and completeness of this logic, a lot of examples are given. Chapter 4 shows the connection between fuzzy relations, approximate reasoning and fuzzy IF-THEN rules to residuated lattices. (shrink)

Using the genetic algorithm and fuzzy logic, this study presents a nonlinear approach to the evaluation of biofunctional intelligence. According to the biofunctional model, intelligence may be viewed as a multisource phenomenon resulting in part from the interaction of learning processes and sources of self-regulation. Learning processes are regulated by three sources of control , producing three subprocesses for each learning process. This paper examines the role of five such subprocesses as contributors to intelligence. Fuzzy logic (...) captures the fuzzy nature of human intelligence with GA providing a method for determining and optimizing the contribution of these learning subprocesses. (shrink)

This paper aims at being a systematic investigation of different completeness properties of first-order predicate logics with truth-constants based on a large class of left-continuous t-norms . We consider standard semantics over the real unit interval but also we explore alternative semantics based on the rational unit interval and on finite chains. We prove that expansions with truth-constants are conservative and we study their real, rational and finite chain completeness properties. Particularly interesting is the case of considering canonical (...) real and rational semantics provided by the algebras where the truth-constants are interpreted as the numbers they actually name. Finally, we study completeness properties restricted to evaluated formulae of the kind , where φ has no additional truth-constants. (shrink)

Justification logics are special kinds of modal logics which provide a framework for reasoning about epistemic justifications. For this, they extend classical boolean propositional logic by a family of necessity-style modal operators “t : ”, indexed over t by a corresponding set of justification terms, which thus explicitly encode the justification for the necessity assertion in the syntax. With these operators, one can therefore not only reason about modal effects on propositions but also about dynamics inside the (...) justifications themselves. We replace this classical boolean base with Gödel logic, one of the three most prominent fuzzy logics, i.e. special instances of many-valued logics, taking values in the unit interval [0, 1], which are intended to model inference under vagueness. We extend the canonical possible-world semantics for justification logic to this fuzzy realm by considering fuzzy accessibility- and evaluation-functions evaluated over the minimum t-norm and establish strong completeness theorems for various fuzzy analogies of prominent extensions for basic justification logic. (shrink)

The logic of a physical system consists of the elementary observables of the system. We show that for chaotic systems the logic is not any more the classical Boolean lattice but a kind of fuzzy logic which we characterize for a class of chaotic maps. Among other interesting properties the fuzzy logic of chaos does not allow for infinite combinations of propositions. This fact reflects the instability of dynamics and it is shared also by (...) quantum systems with diagonal singularity. We also generalize the fuzzy implication to a probabilistic implication following the hint of von Neumann. In this way we can evaluate the probability of the validity of the logical inference. (shrink)

A dam is a complex and important water-retaining structure. Once the dam is broken, the flood will cause immeasurable damage to the lives and properties of the downstream people, so it is particularly important to have the dam risk management. Since the dam-break flood is a severe-consequence low-frequency event, the corresponding fatalities caused by it are difficult to estimate due to the lack of relevant data and poor data continuity. This paper analyzes the direct and indirect factors affecting the risk (...) of life loss in dam failures and studies the characteristics, distribution rules, and membership functions of each factor. An adaptive differential evolution method is constructed through an optimization of the mutation factors and cross factors of the differential evolution method. This proposed evaluation method also combines with the fuzzy clustering iterative method that is capable of evaluating the similarity of life loss in dam accidents. The effectiveness of the proposed method is verified by 16 dam-break case studies. (shrink)

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)

Aiming at the problem of inaccurate classification of big data information in traditional English teaching ability evaluation algorithms, an English teaching ability evaluation algorithm based on big data fuzzy K-means clustering and information fusion is proposed. Firstly, the author uses the idea of K-means clustering to analyze the collected original error data, such as teacher level, teaching facility investment, and policy relevance level, removes the data that the algorithm considers unreliable, uses the remaining valid data to calculate the weighting (...) factor of the modified fuzzy logic algorithm, and evaluates the weighted average with the node measurement data and gets the final fusion value. Secondly, the author integrates the big data information fusion and K-means clustering algorithm, realizes the clustering and integration of the index parameters of English teaching ability, compiles the corresponding English teaching resource allocation plan, and realizes the evaluation of English teaching ability. Finally, the results show that using this method to evaluate English teaching ability has better information fusion analysis ability, which improves the accuracy of teaching ability evaluation and the efficiency of teaching resources application. (shrink)

Water quality prediction is the basis of water environmental planning, evaluation, and management. In this work, a novel intelligent prediction model based on the fuzzy wavelet neural network including the neural network, the fuzzy logic, the wavelet transform, and the genetic algorithm was proposed to simulate the nonlinearity of water quality parameters and water quality predictions. A self-adapted fuzzy c-means clustering was used to determine the number of fuzzy rules. A hybrid learning algorithm based on (...) a genetic algorithm and gradient descent algorithm was employed to optimize the network parameters. Comparisons were made between the proposed FWNN model and the fuzzy neural network, the wavelet neural network, and the neural network. The results indicate that the FWNN made effective use of the self-adaptability of NN, the uncertainty capacity of FL, and the partial analysis ability of WT, so it could handle the fluctuation and the nonseasonal time series data of water quality, while exhibiting higher estimation accuracy and better robustness and achieving better performances for predicting water quality with high determination coefficients R2 over 0.90. The FWNN is feasible and reliable for simulating and predicting water quality in river. (shrink)

In this paper we investigate the connections between quantifier elimination, decidability and Uniform Craig Interpolation in Δ-core fuzzy logics added with propositional quantifiers. As a consequence, we are able to prove that several propositional fuzzy logics have a conservative extension which is a Δ-core fuzzy logic and has Uniform Craig Interpolation.

The developing academic field of machine ethics seeks to make artificial agents safer as they become more pervasive throughout society. In contrast to computer ethics, machine ethics is concerned with the behavior of machines toward human users and other machines. This study aims to use an action-based ethical theory founded on the combinational aspects of deontological and teleological theories of ethics in the construction of an artificial moral agent (AMA).,The decision results derived by the AMA are acquired via (...) class='Hi'>fuzzy logic interpretation of the relative values of the steady-state simulations of the corresponding rule-based fuzzy cognitive map (RBFCM).,Through the use of RBFCMs, the following paper illustrates the possibility of incorporating ethical components into machines, where latent semantic analysis (LSA) and RBFCMs can be used to model dynamic and complex situations, and to provide abilities in acquiring causal knowledge.,This approach is especially appropriate for data-poor and uncertain situations common in ethics. Nonetheless, to ensure that a machine with an ethical component can function autonomously in the world, research in artificial intelligence will need to further investigate the representation and determination of ethical principles, the incorporation of these ethical principles into a system’s decision procedure, ethical decision-making with incomplete and uncertain knowledge, the explanation for decisions made using ethical principles and the evaluation of systems that act based upon ethical principles.,To date, the conducted research has contributed to a theoretical foundation for machine ethics through exploration of the rationale and the feasibility of adding an ethical dimension to machines. Further, the constructed AMA illustrates the possibility of utilizing an action-based ethical theory that provides guidance in ethical decision-making according to the precepts of its respective duties. The use of LSA illustrates their powerful capabilities in understanding text and their potential application as information retrieval systems in AMAs. The use of cognitive maps provides an approach and a decision procedure for resolving conflicts between different duties.,This paper suggests that cognitive maps could be used in AMAs as tools for meta-analysis, where comparisons regarding multiple ethical principles and duties can be examined and considered. With cognitive mapping, complex and abstract variables that cannot easily be measured but are important to decision-making can be modeled. This approach is especially appropriate for data-poor and uncertain situations common in ethics. (shrink)

This paper presents a logical Style painting classifier based on evaluated Horn clauses, qualitative colour descriptors and Explanations. Three versions of $\ell $-SHE are defined, using rational Pavelka logic, and expansions of Gödel logic and product logic with rational constants: RPL, $G$ and $\sqcap $, respectively. We introduce a fuzzy representation of the more representative colour traits for the Baroque, the Impressionism and the Post-Impressionism art styles. The $\ell $-SHE algorithm has been implemented in (...) Swi-Prolog and tested on 90 paintings of the QArt-Dataset and on 247 paintings of the Paintings-91-PIB dataset. The percentages of accuracy obtained in the QArt-Dataset for each $\ell $-SHE version are 73.3%, 65.6% $) and 68.9% $). Regarding the Paintings-91-PIB dataset, the percentages of accuracy obtained for each $\ell $-SHE version are 60.2%, 48.2% $) and 57.0% $). Our logic definition for the Baroque style has obtained the highest accuracy in both datasets, for all the $\ell $-SHE versions. An important feature of the classifier is that it provides reasons regarding why a painting belongs to a certain style. The classifier also provides reasons about why outliers of one art style may belong to another art style, giving a second classification option depending on its membership degrees to these styles. (shrink)

In cloud security, intrusion detection system (IDS) is one of the challenging research areas. In a cloud environment, security incidents such as denial of service, scanning, malware code injection, virus, worm, and password cracking are getting usual. These attacks surely affect the company and may develop a financial loss if not distinguished in time. Therefore, securing the cloud from these types of attack is very much needed. To discover the problem, this paper suggests a novel IDS established on a combination (...) of a leader-based k-means clustering (LKM), optimal fuzzy logic system. Here, at first, the input dataset is grouped into clusters with the use of LKM. Then, cluster data are afforded to the fuzzy logic system (FLS). Here, normal and abnormal data are inquired by the FLS, while FLS training is done by the grey wolf optimization algorithm through maximizing the rules. The clouds simulator and NSL-Knowledge Discovery and DataBase (KDD) Cup 99 dataset are applied to inquire about the suggested method. Precision, recall, and F-measure are conceived as evaluation criteria. The obtained results have denoted the superiority of the suggested method in comparison with other methods. (shrink)

Fuzzy sets and fuzzy logics are used to model events with imprecise, incomplete, and uncertain information. Researchers have developed numerous methods and techniques to cope with fuzziness or uncertainty. This research intends to introduce the novel concepts of complex neutrosophic relations and its types based on the idea of complex neutrosophic sets. In addition, these concepts are supported by suitable examples. A CNR discusses the quality of a relationship using the degree of membership, the degree of (...) abstinence, and the degree of nonmembership. Each of these degrees is a complex number from the unit circle in a complex plane. The real part of complex-valued degrees represents the amplitude term, while the imaginary part represents the phase term. This property empowers CNRs to model multidimensional variables. Moreover, some interesting properties and useful results have also been proved. Furthermore, the practicality of the proposed concepts is verified by an application, which discusses the use of the proposed concepts in statistical decision-making. Additionally, a comparative analysis between the novel concepts of CNRs and the existing methods is carried out. (shrink)

Reasoning with quantifier expressions in natural language combines logical and arithmetical features, transcending strict divides between qualitative and quantitative. Our topic is this cooperation of styles as it occurs in common linguistic usage and its extension into the broader practice of natural language plus ‘grassroots mathematics’.We begin with a brief review of by changing the semantics of counting in natural ways. A first approach replaces cardinalities by abstract but well-motivated values of ‘mass’ or other mereological aggregating notions. A (...) second approach keeps the cardinalities but generalizes the meaning of counting to work in models that allow dependencies between variables.Finally, we return to our starting point in natural language, confronting the architecture of our formal systems with linguistic quantifier vocabulary and syntax, as well as with natural reasoning modules such as the monotonicity calculus. In addition to these encounters with formal semantics, we discuss the role of counting in semantic evaluation procedures for quantifier expressions and determine, for instance, which binary quantifiers are computable by finite ‘semantic automata’. We conclude with some general thoughts on yet further entanglements of logic and counting in formal systems, on rethinking the qualitative/quantitative divide, and on connecting our analysis to empirical findings in cognitive science. (shrink)

Theodor Adorno was a German philosopher, sociologist and musicologist and was a leading member and eventually director of the Frankfurt Institute for Social Research. Adorno studied an extraordinary range of subjects during his lifetime – from dialectical logic and the syntax of poetry to newspaper astrology columns and the Hollywood studio system – and he left a significant mark on each of the many disciplines in which he worked. His philosophically sophisticated rethinking of Marxian materialism has been central (...) to much European and American social theory in the latter half of the twentieth century and his studies of mass culture, radio and television were foundational documents for the discipline of cultural studies. This collection charts the most important moments in the international reception of Adorno's thinking, covering the wide range of disciplines his studies touched upon, including literary criticism, musicology, aesthetics, epistemology and metaphysics. There is also a great deal of important scholarship and commentary on Adorno in German that remains untranslated into English. This set will therefore provide Anglophone scholars with the first English translations of these important works. (shrink)

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)

In a series of articles, Paul Thagard has developed a connectionist''s modelfor the evaluation of explanatory coherence for competing systems ofhypotheses. He has successfully applied it to various examples from thehistory of science and common language reasoning. However, I will argue thathis formalism does not adequately represent explanatory relations betweenmore than two propositions.In this paper, I develop a generalization of Thagard''s approach. It is notsubject to the connectionist paradigm of neural nets, but is based on fuzzylogic: Explanatory coherence increases (...) class='Hi'>with the fuzzy truth value of theconjunction of explanans and explanandum and decreases with the value of theconjunction of explanans and the negation of the explanandum. (shrink)

This paper suggests a method to calculate a degree of validity for the proof of a statement which is derived from empirical statements by means of logic conclusions. The empirical statements are assumed not to be completely valid or their validity to be doubtful. The suggested rules are consistent with two-valued logic, yield decreasing validities with increasing number of applications of modus ponens and obey the law of the excluded middle. The actual calculation of validity values, (...) the relation of the suggested method to some truth tables of multi-valued logic and to fuzzy logic are discussed. (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 major reason given in the philosophical literature for dissatisfaction with theories of vagueness based on fuzzy logic is that such theories give rise to a problem of higherorder vagueness or artificial precision. In this paper I first outline the problem and survey suggested solutions: fuzzy epistemicism; measuring truth on an ordinal scale; logic as modelling; fuzzy metalanguages; blurry sets; and fuzzy plurivaluationism. I then argue that in order to decide upon a solution, (...) we need to understand the true nature and source of the problem. Two possible sources are discussed: the problem stems from the very nature of vagueness—from the defining features of vague predicates; or the problem stems from the way in which the meanings of predicates are determined—by the usage of speakers together with facts about their environment and so on. I argue that the latter is the true source of the problem, and on this basis that fuzzy plurivaluationism is the correct solution. (shrink)

We consider a modal language over crisp frames and formulas evaluated on a finite MTL-chain (a linearly ordered commutative integral residuated lattice). We first show that the basic modal abstract logic with constants for the values of the MTL-chain is the maximal abstract logic satisfying Compactness, the Tarski Union Property and strong invariance for bisimulations. Finally, we improve this result by replacing the Tarski Union Property by a relativization property.

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.

The Gödel–Dummett logic and Łukasiewicz one are two main many-valued logics used by the fuzzy logic community. Our goal is a quantitative comparison of these two. In this paper, we will mostly consider the 3-valued Gödel–Dummett logic as well as the 3-valued Łukasiewicz one. We shall concentrate on their implicational-negation fragments which are limited to formulas formed with a fixed finite number of variables. First, we investigate the proportion of the number of true formulas of (...) a certain length n to the number of all formulas of such length built with exactly one variable. Then, we investigate such proportion for satisfiable formulas. Second, we generalise our investigation on formulas written with k≥1 variables. The primary goal of the paper is the research on the asymptotic behaviour of these fractions when the length n tends to infinity. If such limits exists, they are real numbers between 0 and 1, which are called the density of truth or the density of SAT. To compare the density of truth and the density of satisfiable formulas for both fragments of 3-valued Gödel–Dummett's and Łukasiewicz's logics we use the powerful theory of analytic combinatorics. This paper is a natural continuation of the previous brief conference note by Kostrzycka and Zaionc (Citation2020) as well as enriched with some previous results from Kostrzycka and Zaionc (Citation2003). In the conference note we computed analytically the density of truth and the density of SAT (with a determined precision) for 3-valued Łukasiewicz's logic restricted to a language with only one variable. In Kostrzycka and Zaionc (Citation2003) we computed the same values for exactly the same fragment of the 3-valued Gödel–Dummett logic. This paper answers the more general questions of the existence of density of truth and density of SAT for both many-valued logics with an arbitrary finite number of variables. Therefore this paper gives an an interesting picture of two main families of finite-valued fuzzy logics problems treated quantitatively. This picture is taken from the perspective of classical logic. It shows that unexpectedly there is quantitatively a little distance between these two approaches. (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)

In this dissertation we present proof systems for several modal logics. These proof systems are based on analytic (or semantic) tableaux. -/- Modal logics are logics for reasoning about possibility, knowledge, beliefs, preferences, and other modalities. Their semantics are almost always based on Saul Kripke’s possible world semantics. In Kripke semantics, models are represented by relational structures or, equivalently, labeled graphs. Syntactic formulas that express statements about knowledge and other modalities are evaluated in terms of such models. -/- This (...) dissertation focuses on modal logics with dynamic operators for public announcements, belief revision, preference upgrades, and so on. These operators are defined in terms of mathematical operations on Kripke models. Thus, for example, a belief revision operator in the syntax would correspond to a belief revision operation on models. -/- The ‘dynamic’ semantics of dynamic modal logics are a clever way of extending languages without compromising on intuitiveness. We present ‘dynamic’ tableau proof systems for these dynamic semantics, with the express aim to make them conceptually simple, easy to use, modular, and extensible. This we do by reflecting the semantics as closely as possible in the components of our tableau system. For instance, dynamic operations on Kripke models have counterpart dynamic relations between tableaux. -/- Soundness, completeness, and decidability are three of the most important properties that a proof system may have. A proof system is sound if and only if any formula for which a proof exists, is true in every model. A proof system is complete if and only if for any formula that is true in all models, a proof exists. A proof system is decidable if and only if any formula can be proved to be a theorem or not a theorem in a finite number of steps. All proof systems in this dissertation are sound, complete, and decidable. -/- Part of our strategy to create modular tableau systems is to delay concerns over decidability until after soundness and completeness have been established. Decidability is attained through the operations of folding and through operations on ‘tableau cascades’, which are graphs of tableaux. -/- Finally, we provide a proof-of-concept implementation of our dynamic tableau system for public announcement logic in the Clojure programming language. (shrink)

Medical knowledge as well as clinical practice are characterized by inescapable uncertainty. There are many reasons this is the case, but foremost among them is that almost everything in medicine is inevitably vague, be it something linguistic such as the term “illness”, or something extra-linguistic such as the condition referred to as illness. If we ask ourselves, then, what the term “illness” means exactly, on the one hand; and how we may precisely delimit the condition illness, on the other; we (...) shall realize that to answer these and similar questions requires specific methods that enable us to adequately cope with vagueness. As we shall see below, fuzzy logic provides us with just such methods. (shrink)

In this paper we prove strong completeness of axiomatic extensions of first-order strict core fuzzy logics with the so-called quasi-witnessed axioms with respect to quasi-witnessed models. As a consequence we obtain strong completeness of Product Predicate Logic with respect to quasi-witnessed models, already proven by M.C. Laskowski and S. Malekpour in [19]. Finally we study similar problems for expansions with Δ, define Δ-quasi-witnessed axioms and prove that any axiomatic extension of a first-order strict core (...) fuzzy logic, expanded with Δ, and Δ-quasi-witnessed axioms are complete with respect to Δ-quasi-witnessed models. (shrink)

Fuzzy logics are many-valued logics that are well suited to reasoning in the context of vagueness. They provide the basis for the wider field of Fuzzy Logic, encompassing diverse areas such as fuzzy control, fuzzy databases, and fuzzy mathematics. This book provides an accessible and up-to-date introduction to this fast-growing and increasingly popular area. It focuses in particular on the development and applications of "proof-theoretic" presentations of fuzzy logics; the result of more than (...) ten years of intensive work by researchers in the area, including the authors. In addition to providing alternative elegant presentations of fuzzy logics, proof-theoretic methods are useful for addressing theoretical problems and developing efficient deduction and decision algorithms. Proof-theoretic presentations also place fuzzy logics in the broader landscape of non-classical logics, revealing deep relations with other logics studied in Computer Science, Mathematics, and Philosophy. The book builds methodically from the semantic origins of fuzzy logics to proof-theoretic presentations such as Hilbert and Gentzen systems, introducing both theoretical and practical applications of these presentations. (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)

This essay explores the place of coconstrual relations, such as antecedent-anaphor relations, in a theory of grammar informed by minimalist architecture. It has been argued that the logical space created by minimalist theorizing should favor an account of coconstrual derived from the tree-building operations of narrow syntax (Agree, feature theory, Merge and its subcase, Remerge), dispensing with rules or conditions that evaluate constructed trees. On such an account, it is argued, the explanatory power of narrow syntax is (...) enhanced and the role of the interpretive component can be circumscribed. However, if coconstrual cannot be reduced to the derivational relations of narrow syntax, then we must be prepared to reevaluate the role of syntax-sensitive interpretive rules, balancing the need for such rules against any complication of narrow syntax mechanisms just to account for coconstrual. It will be argued that dependent identity relations, the form of coconstrual that is sensitive to syntactic configurations, must be interpreted from the output of narrow syntax and are not expressed within narrow syntax at all. This result unburdens narrow syntax of a class of relations that bring theoretical and empirical complications, while providing a more elegant account of coconstrual in a broader conception of the interpretive interface. (shrink)

The evolution in the quality of teaching for preschool education is worth studying. In this article, we solved the qualitative problems in the comprehensive quality evaluation by suggesting a method of quantitative combination and establishing a set of indicators suitable for the comprehensive quality evaluation of students in the kindergarten. According to the experience summed up by previous scholars, the weight of each index is obtained by an analytic hierarchy process. This study analyzed the defects and causes of fuzzy (...) comprehensive evaluation and the neural network model in the construction of early childhood and preschool education's comprehensive quality evaluation model and propose a Feedforward Neural Network model. FNN combined with neural network and fuzzy logic characteristics introduces fuzzy concepts and fuzzy inference rules into neural networks of neurons, the connection power, and network learning. It improves the learning ability of NN and fuzzy evaluation of the power of expression and effectively exerts the advantages of fuzzy logic and neural network to make up for their shortcomings. However, the convergence speed is very slow. To solve this problem, the similarity measure was used to improve the number of hidden layer nodes of the network. The effectiveness and feasibility of the FNN improved hidden layer nodes are verified by an example so as to realize the automation of comprehensive quality evaluation. (shrink)

Fuzzy logic is finding increased application in the control of real-world processes and in the work with and the manipulation of inexact knowledge. Two of the major attractions of fuzzy logic are: it permits one to express problems in (familiar) linguistic terms and it can be applied where the numerical mathematical model of a system may be too complex or impossible to build using conventional techniques. This book, written in an easily accessible style, assumes that (...) students have a solid background in embedded systems including basic logic design and C/C programming. (shrink)

We present a general theory of scope and binding in which both crossover and superiority violations are ruled out by one key assumption: that natural language expressions are normally evaluated (processed) from left to right. Our theory is an extension of Shan’s (2002) account of multiple-wh questions, combining continuations (Barker, 2002) and dynamic type-shifting. Like other continuation-based analyses, but unlike most other treatments of crossover or superiority, our analysis is directly compositional (in the sense of, e.g., Jacobson, 1999). In (...) particular, it does not postulate a level of Logical Form or any other representation distinct from surface syntax. One advantage of using continuations is that they are the standard tool for modeling order-of-evaluation in programming languages. This provides us with a natural and independently motivated characterization of what it means to evaluate expressions from left to right. We give a combinatory categorial grammar that models the syntax and the semantics of quantifier scope and wh-question formation. It allows quantificational binding but not crossover, in-situ wh but not superiority violations. In addition, the analysis automatically accounts for a variety of sentence types involving binding in the presence of pied piping, including reconstruction cases such as Whose criticism of hisi mother did each personi resent? (shrink)

The article presents several adaptive fuzzy hedge logics. These logics are designed to perform a specific kind of hedge detection. Given a premise set Γ that represents a series of communicated statements, the logics can check whether some predicate occurring in Γ may be interpreted as being (implicitly) hedged by technically, strictly speaking or loosely speaking, or simply non-hedged. The logics take into account both the logical constraints of the premise set as well as conceptual information concerning the meaning (...) of potentially hedged predicates (stored in the memory of the interpreter in question). The proof theory of the logics is non-monotonic in order to enable the logics to deal with possible non-monotonic interpretation dynamics (this is illustrated by means of several concrete proofs). All the adaptive fuzzy hedge logics are also sound and strongly complete with respect to their [0,1]-semantics. (shrink)

Axiomatizations are presented for fuzzy logics characterized by uninorms continuous on the half-open real unit interval [0,1), generalizing the continuous t-norm based approach of Hájek. Basic uninorm logic BUL is defined and completeness is established with respect to algebras with lattice reduct [0,1] whose monoid operations are uninorms continuous on [0,1). Several extensions of BUL are also introduced. In particular, Cross ratio logic CRL, is shown to be complete with respect to one special uninorm. (...) A Gentzen-style hypersequent calculus is provided for CRL and used to establish co-NP completeness results for these logics. (shrink)

We show that it is possible to base fuzzy control on fuzzy logic programming. Indeed, we observe that the class of fuzzy Herbrand interpretations gives a semantics for fuzzy programs and we show that the fuzzy function associated with a fuzzy system of IF-THEN rules is the fuzzy Herbrand interpretation associated with a suitable fuzzy program.

A new deontic logic, Action Type Deontic Logic, is presented. To motivate this logic, a number of benchmark cases are shown, representing inferences a deontic logic should validate. Some of the benchmark cases are singled out for further comments and some formal approaches to deontic reasoning are evaluated with respect to the benchmark cases. After that follows an informal introduction to the ideas behind the formal semantics, focussing on the distinction between action types and (...) action tokens. Then the syntax and semantics of Action Type Deontic Logic is presented and it is shown to meet the benchmarks. Finally, possibilities for further research are indicated. In the appendix, decidability of the satisfiability of formulas is proved via a technique known from monadic First Order Logic. (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)

This paper is a contribution to the general study of consequence relations which contain (definable) connective of “disjunction”. Our work is centered around the “proof by cases property”, we present several of its equivalent definitions, and show some interesting applications, namely in constructing axiomatic systems for intersections of logics and recognizing weakly implicative fuzzy logics among the weakly implicative ones.

Important works of Mostowski and Rasiowa dealing with many-valued logic are analyzed from the point of view of contemporary mathematical fuzzy logic.

This article proposes the meeting of fuzzy logic with paraconsistency in a very precise and foundational way. Specifically, in this article we introduce expansions of the fuzzy logic MTL by means of primitive operators for consistency and inconsistency in the style of the so-called Logics of Formal Inconsistency (LFIs). The main novelty of the present approach is the definition of postulates for this type of operators over MTL-algebras, leading to the definition and axiomatization of a (...) family of logics, expansions of MTL, whose degree-preserving counterpart are paraconsistent and moreover LFIs. (shrink)

This book is about the processing of information in face-to-face communication when a speaker makes both audible and visible information available to a perceiver. Both auditory and visual sources of information are evaluated and integrated to achieve speech perception. The evaluation of the information source provides information about the strength of alternative interpretations, rather than just all-or-none categorical information, as claimed by “categorical perception” theory. Information sources are evaluated independently; the integration process insures that the least ambiguous sources (...) have the most influences on the judgment. Similar processes occur in a variety of other behaviors, ranging from personality judgments and categorization to sentence interpretation and decision making. The experimental results are consistent with a fuzzy logical model of perception, positing three operations in perceptual (primary) recognition: feature evaluation, feature integration, and pattern classification. Continuously valued features are first evaluated, then integrated and matched against prototype descriptions in memory; finally, an identification decision is made on the basis of the relative goodness-of-match of the stimulus information with the relevant prototype descriptions. (shrink)

Let S be a set, P the class of all subsets of S and F the class of all fuzzy subsets of S. In this paper an “extension principle” for closure operators and, in particular, for deduction systems is proposed and examined. Namely we propose a way to extend any closure operator J defined in P into a fuzzy closure operator J* defined in F. This enables us to give the notion of canonical extension of a deduction system (...) and to give interesting examples of fuzzy logics. In particular, the canonical extension of the classical propositional calculus is defined and it is showed its connection with possibility and necessity measures. Also, the canonical extension of first order logic enables us to extend some basic notions of programming logic, namely to define the fuzzy Herbrand models of a fuzzy program. Finally, we show that the extension principle enables us to obtain fuzzy logics related to fuzzy subalgebra theory and graded consequence relation theory. (shrink)

Fuzzy logic has become an important tool for a number of different applications ranging from the control of engineering systems to artificial intelligence. In this concise introduction, the author presents a succinct guide to the basic ideas of fuzzy logic, fuzzy sets, fuzzy relations, and fuzzy reasoning, and shows how they may be applied. The book culminates in a chapter which describes fuzzy logic control: the design of intelligent control systems using (...) fuzzy if-then rules which make use of human knowledge and experience to behave in a manner similar to a human controller. Throughout, the level of mathematical knowledge required is kept basic and the concepts are illustrated with numerous diagrams to aid in comprehension. As a result, all those curious to know more about fuzzy concepts and their real-world application will find this a good place to start. (shrink)