Professor Merrie Bergmann presents an accessible introduction to the subject of many-valued and fuzzy logic designed for use on undergraduate and graduate courses in non-classical logic. Bergmann discusses the philosophical issues that give rise to fuzzy logic - problems arising from vague language - and returns to those issues as logical systems are presented. For historical and pedagogical reasons, three-valued logical systems are presented as useful intermediate systems for studying the principles and theory behind (...) class='Hi'>fuzzy logic. The major fuzzy logical systems - Lukasiewicz, Gödel, and product logics - are then presented as generalisations of three-valued systems that successfully address the problems of vagueness. A clear presentation of technical concepts, this book includes exercises throughout the text that pose straightforward problems, that ask students to continue proofs begun in the text, and that engage students in the comparison of logical systems. (shrink)

Standpoint logic is a recently proposed formalism in the context of knowledge integration, which advocates a multi-perspective approach permitting reasoning with a selection of diverse and possibly conflicting standpoints rather than forcing their unification. In this paper, we introduce nested sequent calculi for propositional standpoint logics---proof systems that manipulate trees whose nodes are multisets of formulae---and show how to automate standpoint reasoning by means of non-deterministic proof-search algorithms. To obtain worst-case complexity-optimal proof-search, we introduce a novel technique in the (...) context of nested sequents, referred to as "coloring," which consists of taking a formula as input, guessing a certain coloring of its subformulae, and then running proof-search in a nested sequent calculus on the colored input. Our technique lets us decide the validity of standpoint formulae in CoNP since proof-search only produces a partial proof relative to each permitted coloring of the input. We show how all partial proofs can be fused together to construct a complete proof when the input is valid, and how certain partial proofs can be transformed into a counter-model when the input is invalid. These "certificates" (i.e. proofs and counter-models) serve as explanations of the (in)validity of the input. (shrink)

This chapter contains sections titled: Two‐and Three‐Valued Logics Finite Valued Systems with more than Three Values Infinite Valued Systems Vagueness, Many‐valued and Fuzzy Logics Boolean Valued Systems Supervaluations are Boolean Valued Logics Free Logic Intuitionism Conclusions.

Some aspects of vagueness as presented in Shapiro’s book Vagueness in Context [23] are analyzed from the point of fuzzy logic. Presented are some generalizations of Shapiro’s formal apparatus.

This short paper about fuzzy set-based approximate reasoning first emphasizes the three main semantics for fuzzy sets: similarity, preference and uncertainty. The difference between truth-functional many-valued logics of vague or gradual propositions and non fully compositional calculi such as possibilistic logic or similarity logics is stressed. Then, potentials of fuzzy set-based reasoning methods are briefly outlined for various kinds of approximate reasoning: deductive reasoning about flexible constraints, reasoning under uncertainty and inconsistency, hypothetical reasoning, (...) exception-tolerant plausible reasoning using generic knowledge, interpolative reasoning, and abductive reasoning. Open problems are listed in the conclusion. (shrink)

Neutrosophy has been introduced some years ago by Florentin Smarandache as a new branch of philosophy dealing with “the origin, nature and scope of neutralities, as well as their interactions with different ideational spectra”. A variety of new theories have been developed on the basic principles of neutrosophy: among them is neutrosophic logics, a family of many-valued systems that can be regarded as a generalization of fuzzy logics. In this paper we present a critical introduction (...) to neutrosophic logics, focusing on the problem of defining suitable neutrosophic propositional connectives and discussing the relationship between neutrosophic logics and other well-known frameworks for reasoning with uncertainty and vagueness, such as (intuitionistic and interval-valued) fuzzy systems and Belnap’s logic. (shrink)

The Boolean many-valued approach to vagueness is similar to the infinite-valued approach embraced by fuzzy logic in the respect in which both approaches seek to solve the problems of vagueness by assigning to the relevant sentences many values between falsity and truth, but while the fuzzy-logic approach postulates linearly-ordered values between 0 and 1, the Boolean approach assigns to sentences values in a many-element complete Boolean algebra. On the modal-precisificational approach represented by Kit (...) Fine, if a sentence is indeterminate in truth value in some world, it is taken to be true in one precisified world accessible from that world and false in another. This paper points to a way to unify these two approaches to vagueness by showing that Fine’s version of the modal-precisificational approach can be combined with the Boolean many-valued approach instead of supervaluationism, one of the most popular approaches to vagueness. (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)

In this paper, I identify the source of the differences between classical logic and many-valued logics (including fuzzy logics) with respect to the set of valid formulas and the set of inferences sanctioned. In the course of doing so, we find the conditions that are individually necessary and jointly sufficient for any many-valued semantics (again including fuzzy logics) to validate exactly the classically valid formulas, while sanctioning exactly the same set of (...) inferences as classical logic. This in turn shows, contrary to what has sometimes been claimed, that at least one class of infinite-valued semantics is axiomatizable. (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)

The dissertation has two parts, each dealing with a problem, namely: 1) What is the most adequate account of fuzziness -the so-called phenomenon of vagueness?, and 2) what is the most plausible solution to the sorites, or heap paradox? I will try to show that fuzzy properties are those which are gradual, amenable to be possessed in a greater or smaller extent. Acknowledgement of degrees in the instantiation of a property allows for a gradual transition from one opposite to (...) the other, each intermediate stage constituting an overlap in certain proportion of both contraries. Hence, degrees in the possession of a property give rise to simple contradictions. The reason why I have chosen those two questions is that they provide the main philosophical motivation for a particular brand of an infinite valued and paraconsistent logic. I will claim that Classical logic (CL) is not adequate to handle fuzzy situations, and, being deficient, is in need of being expanded to make room for degrees of truth and weak contradictions. One can hardly deny the importance of the debate, since what is ultimately at stake is what the limits of truth, rationality, intelligibility and possibility are. The main disciplines within which the research moves are the philosophy of language, philosophy of logic, and ontology. (shrink)

This paper offers the Boolean many-valued solution to the Sorites Paradox. According to the precisification-based Boolean many-valued theory, from which this solution arises, sentences have not only two truth values, truth (or 1) and falsity (or 0), but many Boolean values between 0 and 1. The Boolean value of a sentence is identified with the set of precisifications in which the sentence is true. Unlike degrees fuzzy logic assigns to sentences, Boolean many values (...) are not linearly but only partially ordered; so there are values that are incomparable. Despite this fact, the sentences in a sorites series can be taken as having values in a linear order, and losing (or gaining) value as we move from sentence to sentence in the series. So there is no sharp borderline between 0 and 1. Assigning Boolean many values instead of the two truth values to sentences for their vagueness values is analogous to assigning propositions instead of the truth values to sentences for their semantic values, as propositions are, from our viewpoint, also Boolean many values. (shrink)

This article investigates five kinds of vagueness in medicine: disciplinary, ontological, conceptual, epistemic, and vagueness with respect to descriptive-prescriptive connections. First, medicine is a discipline with unclear borders, as it builds on a wide range of other disciplines and subjects. Second, medicine deals with many indistinct phenomena resulting in borderline cases. Third, medicine uses a variety of vague concepts, making it unclear which situations, conditions, and processes that fall under them. Fourth, medicine is based on and produces uncertain knowledge (...) and evidence. Fifth, vagueness emerges in medicine as a result of a wide range of fact-value-interactions. The various kinds of vagueness in medicine can explain many of the basic challenges of modern medicine, such as overdiagnosis, underdiagnosis, and medicalization. Even more, it illustrates how complex and challenging the field of medicine is, but also how important contributions from the philosophy can be for the practice of medicine. By clarifying and, where possible, reducing or limiting vagueness, philosophy can help improving care. Reducing the various types of vagueness can improve clinical decision-making, informing individuals, and health policy making. (shrink)

The dissertation has two parts, each dealing with a problem, namely: 1) What is the most adequate account of fuzziness -the so-called phenomenon of vagueness?, and 2) what is the most plausible solution to the sorites, or heap paradox? I will try to show that fuzzy properties are those which are gradual, amenable to be possessed in a greater or smaller extent. Acknowledgement of degrees in the instantiation of a property allows for a gradual transition from one opposite to (...) the other, each intermediate stage constituting an overlap in certain proportion of both contraries. Hence, degrees in the possession of a property give rise to simple contradictions. The reason why I have chosen those two questions is that they provide the main philosophical motivation for a particular brand of an infinite valued and paraconsistent logic. I will claim that Classical logic (CL) is not adequate to handle fuzzy situations, and, being deficient, is in need of being expanded to make room for degrees of truth and weak contradictions. One can hardly deny the importance of the debate, since what is ultimately at stake is what the limits of truth, rationality, intelligibility and possibility are. The main disciplines within which the research moves are the philosophy of language, philosophy of logic, and ontology. (shrink)

Interval type-2 fuzzy logic systems have favorable abilities to cope with uncertainties in many applications. While the block type-reduction under the guidance of inference plays the central role in the systems, Karnik-Mendel iterative algorithms are standard algorithms to perform the type-reduction; however, the high computational cost of type-reduction process may hinder them from real applications. The comparison between the KM algorithms and other alternative algorithms is still an open problem. This paper introduces the related theory of interval type-2 (...) fuzzy sets and discusses the blocks of fuzzy reasoning, type-reduction, and defuzzification of interval type-2 fuzzy logic systems by combining the Nagar-Bardini and Nie-Tan noniterative algorithms for solving the centroids of output interval type-2 fuzzy sets. Moreover, the continuous version of NT algorithms is proved to be accurate algorithms for performing the type-reduction. Four computer simulation examples are provided to illustrate and analyze the performances of two kinds of noniterative algorithms. The NB and NT algorithms are superior to the KM algorithms on both calculation accuracy and time, which afford the potential application value for designer and adopters of type-2 fuzzy logic systems. (shrink)

2nd edition. Many-valued logics are those logics that have more than the two classical truth values, to wit, true and false; in fact, they can have from three to infinitely many truth values. This property, together with truth-functionality, provides a powerful formalism to reason in settings where classical logic—as well as other non-classical logics—is of no avail. Indeed, originally motivated by philosophical concerns, these logics soon proved relevant for a plethora of applications ranging (...) from switching theory to cognitive modeling, and they are today in more demand than ever, due to the realization that inconsistency and vagueness in knowledge bases and information processes are not only inevitable and acceptable, but also perhaps welcome. The main modern applications of (any) logic are to be found in the digital computer, and we thus require the practical knowledge how to computerize—which also means automate—decisions (i.e. reasoning) in many-valued logics. This, in turn, necessitates a mathematical foundation for these logics. This book provides both these mathematical foundation and practical knowledge in a rigorous, yet accessible, text, while at the same time situating these logics in the context of the satisfiability problem (SAT) and automated deduction. The main text is complemented with a large selection of exercises, a plus for the reader wishing to not only learn about, but also do something with, many-valued logics. (shrink)

In VAGUENESS AND DEGREES OF TRUTH, Nicholas Smith develops a new theory of vagueness: fuzzy plurivaluationism. -/- A predicate is said to be VAGUE if there is no sharply defined boundary between the things to which it applies and the things to which it does not apply. For example, 'heavy' is vague in a way that 'weighs over 20 kilograms' is not. A great many predicates -- both in everyday talk, and in a wide array of theoretical vocabularies, (...) from law to psychology to engineering -- are vague. -/- Smith argues, based on a detailed account of the defining features of vagueness, that an accurate theory of vagueness must involve the idea that truth comes in degrees. The core idea of degrees of truth is that while some sentences are true and some are false, others possess intermediate truth values: they are truer than the false sentences, but not as true as the true ones. Degree-theoretic treatments of vagueness have been proposed in the past, but all have encountered significant objections. In light of these, Smith develops a new type of degree theory. Its innovations include a definition of logical consequence that allows the derivation of a classical consequence relation from the degree-theoretic semantics, a unified account of degrees of belief and their relationships with degrees of truth and subjective probabilities, and the incorporation of semantic indeterminacy -- the view that vague statements need not have unique meanings -- into the degree-theoretic framework. -/- As well as being essential reading for those working on vagueness, Smith's book provides an excellent entry-point for newcomers to the area -- both from elsewhere in philosophy, and from computer science, logic and engineering. It contains a thorough introduction to existing theories of vagueness and to the requisite logical background. (shrink)

Can one extend crisp Peano arithmetic PA by a possibly many-valued predicate Tr(x) saying "x is true" and satisfying the "dequotation schema" $\varphi \equiv \text{Tr}(\bar{\varphi})$ for all sentences φ? This problem is investigated in the frame of Lukasiewicz infinitely valued logic.

Can one extend crisp Peano arithmetic PA by a possibly many-valued predicate Tr(x) saying “xis true” and satisfying the “dequotation schema”for all sentences φ? This problem is investigated in the frame of Łukasiewicz infinitely valued logic.

In contemporary science uncertainty is often represented as an intrinsic feature of natural and of human phenomena. As an example we need only think of two important conceptual revolutions that occurred in physics and logic during the first half of the twentieth century: (1) the discovery of Heisenberg’s uncertainty principle in quantum mechanics; (2) the emergence of many-valued logical reasoning, which gave rise to so-called ‘fuzzy thinking’. I discuss the possibility of applying the notions of uncertainty, developed (...) in the framework of quantum mechanics, quantum information and fuzzy logics, to some problems of political and social sciences. (shrink)

A many-valued (aka multiple- or multi-valued) semantics, in the strict sense, is one which employs more than two truth values; in the loose sense it is one which countenances more than two truth statuses. So if, for example, we say that there are only two truth values—True and False—but allow that as well as possessing the value True and possessing the value False, propositions may also have a third truth status—possessing neither truth value—then we have a (...) class='Hi'>many-valued semantics in the loose but not the strict sense. A many-valued logic is one which arises from a many-valued semantics and does not also arise from any two-valued semantics [Malinowski, 1993, 30]. By a ‘logic’ here we mean either a set of tautologies, or a consequence relation. We can best explain these ideas by considering the case of classical propositional logic. The language contains the usual basic symbols (propositional constants p, q, r, . . .; connectives ¬, ∧, ∨, →, ↔; and parentheses) and well-formed formulas are defined in the standard way. With the language thus specified—as a set of well-formed formulas—its semantics is then given in three parts. (i) A model of a logical language consists in a free assignment of semantic values to basic items of the non-logical vocabulary. Here the basic items of the non-logical vocabulary are the propositional constants. The appropriate kind of semantic value for a proposition is a truth value, and so a model of the language consists in a free assignment of truth values to basic propositions. Two truth values are countenanced: 1 (representing truth) and 0 (representing falsity). (ii) Rules are presented which determine a truth value for every proposition of the language, given a model. The most common way of presenting these rules is via truth tables (Figure 1). Another way of stating such rules—which will be useful below—is first to introduce functions on the truth values themselves: a unary function ¬ and four binary functions ∧, ∨, → and ↔ (Figure 2).. (shrink)

Vagueness, as discussed in the philosophical literature, is the phenomenon that paradigmatically rears its head in the sorites paradox, one prominent version of which is: One grain of sand does not make a heap. For any n, if n grains of sand do not make a heap, then n + 1 grains of sand do not make a heap. So, ten billion grains of sand do not make a heap. It is common ground that the different versions of the sorites (...) paradox arise because of vagueness in a key expression, in this case ‘heap’. One central concern in the literature on vagueness is to find a solution to the sorites paradox. Vagueness also gives rise to borderline cases. Since ‘heap’ is a vague expression, ‘heap’ also gives rise to borderline cases: there are some possible entities such that they are neither clearly heaps nor clearly non-heaps, but instead are borderline heaps. Borderline cases can seem intuitively to present counter-examples to bivalence and the law of excluded middle . If Harry is a borderline case of baldness, ‘Harry is bald’ can seem neither true nor false, whence it presents doubts concerning bivalence. Similarly, one can find the corresponding instance of LEM, ‘Either Harry is bald or Harry is not bald’, suspect. There are three main theories that involve departures from bivalence, and two of them involve rejection of LEM as well. Standard three-valued logic invokes the idea of a third truth-value or truth-value gaps; fuzzy logic invokes the idea of continuum-many truth-values intermediate between truth and falsity. Both these views preserve truth-functionality. Traditional supervaluationism involves rejection of bivalence, but adherence to LEM. The idea is that if an expression is vague there is a range of precisifications associated with it, where, roughly, precisifications are ways the expression could be …. (shrink)

In this paper I argue that the rationality of law and legal decision making would be enhanced by a systematic attempt to recognize and respond to the implications of empirical uncertainty for policy making and decision making. Admission of uncertainty about the accuracy of facts and the validity of assumptions relied on to make inferences of fact is commonly avoided in law because it raises the spectre of paralysis of the capacity to decide issues authoritatively. The roots of this short-sighted (...) view are found in primitive mechanical models of relationships in the empirical and social world – those of objective causality and determinism. Insofar as it is believed that if we had sufficient data a clear and unequivocal answer would be available to each question, admission of uncertainty is seen as a sign of insufficiency, incompetence, impotence, and is avoided whenever a decision that must be seen to be based on valid reasons, cannot be avoided. Avoidance of some decisions, duplicity in others, is the result. -/- Decision-making must be restructured to recognize the provisional and context-bound validity and relevance of the models we use to conceptualize and order our understanding of phenomena, and to utilize this awareness as an instrument in the production of legal policies and decisions that will be authoritative precisely because they are honestly accurate and socially responsible. The paper makes a start on such a re-structuring of the legal process by exploring the implications of the observation that if law is to be “just”: 1) legal policy must be based on accurate information and rationally related to social goals; and 2) decisions applying policy to individual fact situations must be based on assumptions that are both relevant and accurate. -/- Reasons for determinations of fact must be given, otherwise the presumption that the trier of fact is “reasonable” is an unconditional licence to use private modes of logic and theories of social and natural science. What is not disclosed cannot be challenged on grounds of invalidity or irrelevance. Use of “objective validity” as a standard to evaluate conclusions made by the trier of fact in contentious cases would only serve to beg all important questions by concealing: 1) fundamental normative conflict, and 2) the limited nature and applicability of many validity claims. -/- Our use of the phrases “undue risk,” “public interest,” “reasonable,” and “necessary,” reflects the weight we choose to give conflicting social values and goals when we must make decisions in relative ignorance of all the consequences. “Objective criteria” are of limited utility in legal decision-making because their social meaning is derivative. Policy generation in the absence of any coherent conceptual-normative framework, use of vague terminology in legislation stating policy, and the absence of rational means to distinguish between individual cases to which decision-makers are required by law to apply policy, make it inevitable that many legal “decisions” made in the guise of determinations of objective fact, are charades, an arbitrary, capricious, intuitive, subjective (and thus private) use of public decision-making power. -/- Law must alter its aspirations and recognize that rational decision-making is a process that can occur only within parameters set by present knowledge and societal preference structures. Only by working with the constraints imposed by these parameters is it possible to achieve “just” decisions. Where no rational basis for differentiating cases exists, “individualized justice” must be avoided and public policy articulated in law applied uniformly to all cases in a class. The terms “reasonable” and “necessary,” used to describe policy and its consequences for specific cases, must be understood to represent provisional societal assessments, attempts to implement societal preference structures in the face of limited knowledge. Heightened awareness of the limited nature of our knowledge can only result in legal policies that have a more explicit normative basis. (shrink)

This paper examines the relationships between the many-valued logics G~ and Gn~ of Esteva, Godo, Hajek, and Navara, i.e., Godel logic G enriched with Łukasiewicz negation, and neighbors of intuitionistic logic. The popular fragments of Rauszer's Heyting-Brouwer logic HB admit many-valued extensions similar to G which may likewise be enriched with Łukasiewicz negation; the fuzzy extensions of these logics, including HB, are equivalent to G ~, as are their n-valued extensions equivalent to (...) Gn~ for any n ≥ 2. These enriched systems extend Wansing's logic I4C4, showing that Łukasiewicz negation is a species of Nelson's negation of constructible falsity and yielding a Kripke-style semantics for G~ and Gn~ to complement the many-valued semantics. (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.

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)

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)

ABSTRACT 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\ge 1 $ 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 (2020) as well as enriched with some previous results from Kostrzycka and Zaionc (2003). 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 (2003) 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)

We are concerned with formal models of reasoning under uncertainty. Many approaches to this problem are known in the literature e.g. Dempster-Shafer theory [29], [42], bayesian-based reasoning [21], [29], belief networks [29], many-valued logics and fuzzy logics [6], non-monotonic logics [29], neural network logics [14]. We propose rough mereology developed by the last two authors [22-25] as a foundation for approximate reasoning about complex objects. Our notion of a complex object includes, among (...) others, proofs understood as schemes constructed in order to support within our knowledge assertions/hypotheses about reality described by our knowledge incompletely. (shrink)

A very simple many-valued predicate calculus is presented; a completeness theorem is proved and the arithmetical complexity of some notions concerning provability is determined.

We are concerned with formal models of reasoning under uncertainty. Many approaches to this problem are known in the literature e.g. Dempster-Shafer theory [29], [42], bayesian-based reasoning [21], [29], belief networks [29], many-valued logics and fuzzy logics [6], non-monotonic logics [29], neural network logics [14]. We propose rough mereology developed by the last two authors [22-25] as a foundation for approximate reasoning about complex objects. Our notion of a complex object includes, among (...) others, proofs understood as schemes constructed in order to support within our knowledge assertions/hypotheses about reality described by our knowledge incompletely. (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)

This chapter contains sections titled: Origin Many‐Valued Logic Fuzzy Logic in a Broad and Narrow Sense The Basic Fuzzy Propositional Calculus The Basic Fuzzy Predicate Calculus Similarity The Liar and Dequotation Very True Probability Conclusion.

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

Kamp and Fine presented an influential argument against the use of fuzzy logic for linguistic semantics in 1975. However, the argument assumes that contradictions of the form "A and not A" have semantic value zero. The argument has been recently criticized because sentences of this form are actually not perceived as contradictory by naive speakers. I present new experimental evidence arguing that fuzzy logic still isn't useful for linguistic semantics even if we take such naive speaker judgements at (...) face value. Specifically I show that naive speakers judge "A and not A" in the relevant cases as more true than "B and not A" even when A and B are judged to be equally true. A truth functional semantics such as fuzzy logic cannot account for these intuitions directly. (shrink)

A simple complete axiomatic system is presented for the many-valued propositional logic based on the conjunction interpreted as product, the coresponding implication (Goguen's implication) and the corresponding negation (Gödel's negation). Algebraic proof methods are used. The meaning for fuzzy logic (in the narrow sense) is shortly discussed.

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)

It is taken for granted in much of the literature on vagueness that semantic and epistemic approaches to vagueness are fundamentally at odds. If we can analyze borderline cases and the sorites paradox in terms of degrees of truth, then we don’t need an epistemic explanation. Conversely, if an epistemic explanation suffices, then there is no reason to depart from the familiar simplicity of classical bivalent semantics. I question this assumption, showing that there is an intelligible motivation for adopting a (...) many-valued semantics even if one accepts a form of epistemicism. The resulting hybrid view has advantages over both classical epistemicism and traditional many-valued approaches. (shrink)

This paper introduces a logical analysis of convex combinations within the framework of Łukasiewicz real-valued logic. This provides a natural link between the fields of many-valued logics and decision theory under uncertainty, where the notion of convexity plays a central role. We set out to explore such a link by defining convex operators on MV-algebras, which are the equivalent algebraic semantics of Łukasiewicz logic. This gives us a formal language to reason about the expected value of (...) bounded random variables. As an illustration of the applicability of our framework we present a logical version of the Anscombe–Aumann representation result. (shrink)

This paper explores relationships between many-valued logic and fuzzy topology from the viewpoint of duality theory. We first show a fuzzy topological duality for the algebras of Łukasiewicz n -valued logic with truth constants, which generalizes Stone duality for Boolean algebras to the n -valued case via fuzzy topology. Then, based on this duality, we show a fuzzy topological duality for the algebras of modal Łukasiewicz n -valued logic with truth constants, (...) which generalizes Jónsson-Tarski duality for modal algebras to the n -valued case via fuzzy topology. We emphasize that fuzzy topological spaces naturally arise as spectrums of algebras of many-valued logics. (shrink)

This unique textbook states and proves all the major theorems of many-valued propositional logic and provides the reader with the most recent developments and trends, including applications to adaptive error-correcting binary search. The book is suitable for self-study, making the basic tools of many-valued logic accessible to students and scientists with a basic mathematical knowledge who are interested in the mathematical treatment of uncertain information. Stressing the interplay between algebra and logic, the book contains material never (...) before published, such as a simple proof of the completeness theorem and of the equivalence between Chang's MV algebras and Abelian lattice-ordered groups with unit - a necessary prerequisite for the incorporation of a genuine addition operation into fuzzy logic. Readers interested in fuzzy control are provided with a rich deductive system in which one can define fuzzy partitions, just as Boolean partitions can be defined and computed in classical logic. Detailed bibliographic remarks at the end of each chapter and an extensive bibliography lead the reader on to further specialised topics. (shrink)

Fuzzy logics are systems of logic with infinitely many truth values. Such logics have been claimed to have an extremely wide range of applications in linguistics, computer technology, psychology, etc. In this note, we canvass the known results concerning infinitely many valued logics; make some suggestions for alterations of the known systems in order to accommodate what modern devotees of fuzzy logic claim to desire; and we prove some theorems to the effect (...) that there can be no fuzzy logic which will do what its advocates want. Finally, we suggest ways to accommodate these desires in finitely many valued logics. (shrink)

In this paper we give a rather detailed algebraic investigation of interpolation and Beth’s property in propositional many-valued logics extending Hájek’s Basic Logic [P. Hájek, Metamathematics of Fuzzy Logic, Kluwer, 1998], and we connect such properties with amalgamation and strong amalgamation in the corresponding varieties of algebras. It turns out that, while the most interesting extensions of in the language of have deductive interpolation, very few of them have Beth’s property or Craig interpolation. Thus in the (...) last part of the paper we look for conservative extensions of having such properties. (shrink)

An overview of different versions and applications of Lorenzen’s dialogue game approach to the foundations of logic, here largely restricted to the realm of manyvalued logics, is presented. Among the reviewed concepts and results are Giles’s characterization of Łukasiewicz logic and some of its generalizations to other fuzzy logics, including interval based logics, a parallel version of Lorenzen’s game for intuitionistic logic that is adequate for finite- and infinite-valued Gödel logics, and a truth comparison (...) game for infinite-valued Gödel logic. (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.

One of the few points of agreement to be found in mainstream responses to the logical and semantic problems generated by vagueness is the view that if any modification of classical logic and semantics is required at all then it will only be such as to admit underdetermined reference and truth-value gaps. Logics of vagueness including many valued logics, fuzzy logics, and supervaluation logics all provide responses in accord with this view. The thought (...) that an adequate response might require the recognition of cases of overdetermination and truth value gluts has few supporters. This imbalance lacks justification. As it happens, Jaskowski's paraconsistent discussive logic-a logic which admits truth value gluts-can be defended by reflecting on similarities between it and the popular supervaluationist analysis of vagueness already in the philosophical literature. A simple dualisation of supervaluation semantics results in a paraconsistent logic of vagueness based on what has been termed subvaluational semantics. (shrink)

The theory of concept lattices is approached from the point of view of fuzzy logic. The notions of partial order, lattice order, and formal concept are generalized for fuzzy setting. Presented is a theorem characterizing the hierarchical structure of formal fuzzy concepts arising in a given formal fuzzy context. Also, as an application of the present approach, Dedekind–MacNeille completion of a partial fuzzy order is described. The approach and results provide foundations for formal concept analysis (...) of vague data—the propositions “object x has attribute y”, which form the input data to formal concept analysis, are now allowed to have also intermediate truth values, meeting reality better. (shrink)

The position of Polish informatics, as well in research as in didactic, has its roots in achievements of Polish mathematicians of Warsaw School and logicians of Lvov-Warsaw School. Jan Lukasiewicz is considered in the world of computer science as the most famous Polish logician. The parenthesis-free notation, invented by him, is known as PN (Polish Notation) and RPN (Reverse Polish Notation). Lukasiewicz created many-valued logic as a separate subject. The idea of multi-valueness is applied to hardware design ( (...) class='Hi'>many-valued or fuzzy switching, analog computer). Many-valued approach to vague notions and commonsense reasoning is the method of expert systems, databases and knowledge-based systems. Stanis3aw Jaokowski's system of natural deduction is the base of systems of automatic deduction and theorem proving. He created a system of paraconsistent logic. Such logics are used in AI. Kazimierz Ajdukiewicz with his categorial grammar participated in the development of formal grammars, the field significant for programming languages. Andrzej Grzegorczyk had an important contribution to the development of the theory of recursiveness. (shrink)