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

It is shown the complete equivalence between the theory of continuous (enumeration) fuzzy closure operators and the theory of (effective) fuzzy deduction systems in Hilbert style. Moreover, it is proven that any truth-functional semantics whose connectives are interpreted in [0,1] by continuous functions is axiomatizable by a fuzzy deduction system (but not by an effective fuzzy deduction system, in general).

We present a logic for reasoning about attribute dependencies in data involving degrees such as a degree to which an object is red or a degree to which two objects are similar. The dependencies are of the form A ⇒ B and can be interpreted in two ways: first, in data tables with entries representing degrees to which objects have attributes ; second, in database tables where each domain is equipped with a similarity relation. We assume that the degrees form (...) a scale equipped with operations representing many-valued logical connectives. If 0 and 1 are the only degrees, the algebra of degrees becomes the two-element Boolean algebra and the two interpretations become well-known dependencies in Boolean data and functional dependencies of relational databases. In a setting with general scales, we obtain a new kind of dependencies with naturally arising degrees of validity, degrees of entailment, and related logical concepts. The deduction rules of the proposed logic are inspired by Armstrong rules and make it possible to infer dependencies to degrees—the degrees of provability. We provide a soundness and completeness theorem for such a setting asserting that degrees of entailment coincide with degrees of provability, prove the independence of deduction rules, and present further observations. (shrink)

Roy Sorenson offers a unique exploration of an ancient problem: vagueness. Did Buddha become a fat man in one second? Is there a tallest short giraffe? According to Sorenson's epistemicist approach, the answers are yes! Although vagueness abounds in the way the world is divided, Sorenson argues that the divisions are sharp; yet we often do not know where they are. Written in Sorenson'e usual inventive and amusing style, this book offers original insight on language and logic, the way world (...) is, and our understanding of it. (shrink)

The last decade has seen an enormous development in infinite-valued systems and in particular in such systems which have become known as mathematical fuzzy logics. The paper discusses the mathematical background for the interest in such systems of mathematical fuzzy logics, as well as the most important ones of them. It concentrates on the propositional cases, and mentions the first-order systems more superficially. The main ideas, however, become clear already in this restricted setting.

We prove that the sets of standard tautologies of predicate Product Logic and of predicate Basic Logic, as well as the set of standard-satisfiable formulas of predicate Basic Logic are not arithmetical, thus finding a rather satisfactory solution to three problems proposed by Hájek in [H01].

Effective domain theory is applied to fuzzy logic. The aim is to give suitable notions of semi-decidable and decidable L-subset and to investigate about the effectiveness of the fuzzy deduction apparatus.

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.

This is an exploratory paper whose aim is to investigate the potentialities of bilattice theory for an adequate definition of the deduction apparatus for multi-valued logic. We argue that bilattice theory enables us to obtain a nice extension of the graded approach to fuzzy logic. To give an example, a completeness theorem for a logic based on Boolean algebras is proved.

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)

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)