Skip to main content
Log in

On interplay of quantifiers in Gödel-Dummett fuzzy logics

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

Axiomatization of Gödel-Dummett predicate logics S2G, S3G, and PG, where PG is the weakest logic in which all prenex operations are sound, and the relationships of these logics to logics known from the literature are discussed. Examples of non-prenexable formulas are given for those logics where some prenex operation is not available. Inter-expressibility of quantifiers is explored for each of the considered logics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Baaz, M., Preining, N., Zach, R.: Characterization of the Axiomatizable Prenex Fragments of First-Order Gödel Logics. In: 33rd International Symposium on Multiple-valued Logic, May 16–19, 2003, pp 175–180, Tokyo, IEEE Computer Society Press, 2003

  2. Dummett, M.: A Propositional Calculus with Denumerable Matrix. J. Symbolic Logic 25, 97–106 (1959)

    MathSciNet  Google Scholar 

  3. Hájek, P.: Metamathematics of Fuzzy Logic. Kluwer, 1998

  4. Hájek, P.: A Non-Arithmetical Gödel Logic. Logic Journal of the IGPL 13 (4), 435–441 (2005). A special issue devoted to selected papers presented at the Challenge of Semantics workshop, Vienna, July 2004

    Article  Google Scholar 

  5. Kleene, S.C.: Introduction to Metamathematics. D. van Nostrand, 1952

  6. Kozlíková, B.: Sémantické metody v intuicionistické predikátové logice (Semantical Methods in Intuitionistic Predicate Logic). Master's thesis, Faculty of Arts, Charles University, Department of Logic (2004)

  7. Preining, N.: Complete Recursive Axiomatizability of Gödel Logics. Ph.D. Thesis, Vienna University of Technology, Austria, 2003

  8. Švejdar, V., Bendová, K.: On Inter-Expressibility of Logical Connectives in Gödel Fuzzy Logic. Soft Computing 4 (2), 103–105 (2000)

    Article  Google Scholar 

  9. Švejdar, V.: Note on Inter-Expressibility of Logical Connectives in Finitely-Valued Gödel-Dummett Logics. Soft Computing 10 (7), 629–630 (2006)

    Article  Google Scholar 

  10. Takano, M.: Another Proof of Strong completeness of the Intuitionistic Fuzzy Logic. Tsukuba J. of Math. 11, 101–105 (1987)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vítězslav Švejdar.

Additional information

This work is a part of the research plan MSM 0021620839 that is financed by the Ministry of Education of the Czech Republic. It is based on the first author's master's thesis [6] written under the second author's supervision.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kozlíková, B., Švejdar, V. On interplay of quantifiers in Gödel-Dummett fuzzy logics. Arch. Math. Logic 45, 569–580 (2006). https://doi.org/10.1007/s00153-005-0322-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-005-0322-y

Key words or phrases

Mathematics Subject Classification (2000)

Navigation