Abstract
We are now ready to start our investigation of fuzzy predicate logics (or first-order logics, quantification logics). We shall develop logics broadly analogous to the classical predicate logic; in particular, we shall deal only with two quantifiers, ∀ and ∃ (universal and existential). Generalized quantifiers will be studied in later chapters. In Section 1 we shall develop the predicate counterpart BL∀ of our basic propositional logic BL; in Section 2 we prove a rather general completeness theorem for predicate logics (with respect to semantics over residuated lattices). Sections 3 and 4 are devoted to Gödel and Lukasiewicz predicate logics respectively; we show that Gödel predicate logic has a recursive axiomatization that is complete with respect to the semantics over [0,1], whereas for Łukasiewicz we only present a variant of Pavelka logic. (We show in the next chapter that Łukasiewicz does not have a recursive complete axiomatization.) We close Sec. 4 with some for remarks on the predicate product logic. Sec. 5 discusses many-sorted calculi and Sec. 6 introduces and studies similarity (fuzzy equality). This notion will be crucial for our analysis of fuzzy control in Chap. 7.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Hájek, P. (1998). Many-Valued Predicate Logics. In: Metamathematics of Fuzzy Logic. Trends in Logic, vol 4. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5300-3_5
Download citation
DOI: https://doi.org/10.1007/978-94-011-5300-3_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-0370-7
Online ISBN: 978-94-011-5300-3
eBook Packages: Springer Book Archive