• DocumentCode
    603500
  • Title

    The Complexity of Lukasiewicz Logic

  • Author

    Goldstern, M.

  • Author_Institution
    Vienna Univ. of Technol., Vienna, Austria
  • fYear
    2013
  • fDate
    22-24 May 2013
  • Firstpage
    176
  • Lastpage
    181
  • Abstract
    Lukasiewicz logic is a [0, 1]-valued fuzzy logic with two disjunctions, corresponding to the maximum operation and (truncated) addition. The set of valid formulas for this logic is a complete Π20 set. We give a proof of this result and discuss two variants of this logic: a syntactic variant in which only the classical connectives are allowed, and a semantic variant where we restrict the models to structures with decidable relations.
  • Keywords
    computational complexity; decidability; fuzzy logic; Lukasiewicz logic complexity; [0,1]-valued fuzzy logic; classical connectives; complete Π20 set; decidable relations; disjunctions; semantic variant; syntactic variant; Complexity theory; Computational modeling; Encoding; Fuzzy logic; Semantics; Standards; Syntactics; Lukasiewicz logic; arithmetical hierarchy; complexity; fuzzy logic;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Multiple-Valued Logic (ISMVL), 2013 IEEE 43rd International Symposium on
  • Conference_Location
    Toyama
  • ISSN
    0195-623X
  • Print_ISBN
    978-1-4673-6067-8
  • Electronic_ISBN
    0195-623X
  • Type

    conf

  • DOI
    10.1109/ISMVL.2013.58
  • Filename
    6524659
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=603500