Number of the records: 1  

Arithmetical Complexity of Fuzzy Predicate Logics - A Survey

  1. 1.
    SYSNO ASEP0405556
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleArithmetical Complexity of Fuzzy Predicate Logics - A Survey
    TitleAritmetická složitost fuzzy predikátové logiky - přehled
    Author(s) Hájek, Petr (UIVT-O) RID, SAI
    Source TitleSoft Computing. - : Springer - ISSN 1432-7643
    Roč. 9, č. 12 (2005), s. 935-941
    Number of pages7 s.
    Languageeng - English
    CountryDE - Germany
    Keywordsfuzzy predicate logic ; arithmetical complexity
    Subject RIVBA - General Mathematics
    R&D ProjectsLN00A056 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    CEZAV0Z10300504 - UIVT-O (2005-2011)
    UT WOS000232974500009
    EID SCOPUS27644573109
    DOI10.1007/s00500-004-0448-6
    AnnotationResults on arithmetical complexity of sets of tautologies and satisfiable formulas of various fuzzy logics (with respect to their standard t-norm based semantics as well as with respect to their general BL-algebra based semantics) are surveyed. Some new results are also obtained.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2006

Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.