Skip to main content
SpringerLink
Log in

On arithmetical complexity of fragments of prominent fuzzy predicate logics

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

References

  • Cintula P, Hájek P, Horčík R. Fragments of prominent fuzzy logics. Annals of pure and applied logics (to appear)

  • Hájek P (1998) Metamathematics of fuzzy logic. Kluwer, Dordrecht

    MATH  Google Scholar 

  • Hájek P (2001) Fuzzy logic and arithmetical hierarchy III. Studia logica 68:128–142

    Article  Google Scholar 

  • Hájek P (2005) Arithmetical complexity of fuzzy predicate logics—a survey. Soft Comput 9:935–941

    Article  MATH  Google Scholar 

  • Montagna F (2001) Three complexity problems in quantified fuzzy logic. Stud Logica 68:143–152

    Article  MATH  MathSciNet  Google Scholar 

  • Montagna F (2005) On the predicate logics of continuous t-norm BL-algebras. Arch Math Logic 44:97–114

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Academy of Sciences of the Czech Republic, 182 07, Prague, Czech Republic

    Petr Hájek

Authors
  1. Petr Hájek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Petr Hájek.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hájek, P. On arithmetical complexity of fragments of prominent fuzzy predicate logics. Soft Comput 12, 335–340 (2008). https://doi.org/10.1007/s00500-007-0181-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-007-0181-z

Keywords

Search

Navigation