Soft Computing

, Volume 10, Issue 7, pp 629–630 | Cite as

Note on inter-expressibility of logical connectives in finitely-valued Gödel-Dummett logics

  • V. ŠvejdarEmail author


Let G m be the m-valued Gödel-Dummett fuzzy logic. If m≥3 then neither conjunction nor implication is in G m expressible in terms of the remaining connectives. This fact remains true even if the propositional language is enriched by propositional constants for all truth values.


Fuzzy Logic Mathematical Logic Control Engineer Computing Methodology Logical Connective 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Bendová K (1999) A note on Gödel fuzzy logic. Soft Comput, 2(4):167–167Google Scholar
  2. 2.
    Burdová P (1998) Některé sémantické metody v intuicionistické logice (Some Semantical Methods in Intuitionistic Logic). Master's thesis, Philosophical Faculty of Charles University, Department of LogicGoogle Scholar
  3. 3.
    van Dalen D (1986) Intuitionistic logic. In: Gabbay D, Guenthner F (eds), Handbook of Philosophical Logic, number 164–167 in Synthese Library, chapter III.4. Kluwer, Dordrecht, pp 225–340Google Scholar
  4. 4.
    Dummett M (1959) A propositional calculus with denumerable matrix. J Symbolic Logic 25:97–106Google Scholar
  5. 5.
    Hájek P (1998) Metamathematics of fuzzy logic. KluwerGoogle Scholar
  6. 6.
    Kozlíková B, Švejdar V (2004) On interplay of quantifiers in Gödel-Dummett fuzzy logicsGoogle Scholar
  7. 7.
    Švejdar V, Bendová K (2000) On inter-expressibility of logical connectives in Gödel fuzzy logic. Soft Comput 4(2):103–105Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  1. 1.Faculty of Arts, Dept. of LogicCharles UniversityPraha 1Czeh Republic

Personalised recommendations