All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Deductive Systems of Fuzzy Logic

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F11%3A00379794" target="_blank" >RIV/67985807:_____/11:00379794 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-94-007-0080-2_5" target="_blank" >http://dx.doi.org/10.1007/978-94-007-0080-2_5</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-94-007-0080-2_5" target="_blank" >10.1007/978-94-007-0080-2_5</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Deductive Systems of Fuzzy Logic

  • Original language description

    Lotfi Zadeh is the author of the theory of fuzzy sets. A fuzzy subset A of a (crisp) set X is characterized by assigning to each element x of X the degree of membership of x in A In particular, if X is a set of propositions then its elements may be assigned their degree of truth, which may be ?absolutely true, ?absolutely false or some intermediate truth degree: a proposition may be more true than another proposition. This is obvious in the case of vague (imprecise) propositions like ?this person is old(beautiful, rich, etc.). And this leads to fuzzy logic. In the analogy to various definitions of operations on fuzzy sets (intersection, union, complement,) one may ask how propositions can be combined by connectives (conjunction, disjunction, negation,) and if the truth degree of a composed proposition is determined by the truth degrees of its components, i.e. if the connectives have their corresponding truth functions (like truth tables of classical logic). Saying ?yes (which is the m

  • Czech name

  • Czech description

Classification

  • Type

    C - Chapter in a specialist book

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/IAA100300503" target="_blank" >IAA100300503: Mathematical foundation of inference and decision under uncertainty</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2011

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Book/collection name

    Proof, Computation and Agency. Logic at the Crossroad

  • ISBN

    978-94-007-0079-6

  • Number of pages of the result

    12

  • Pages from-to

    67-78

  • Number of pages of the book

    400

  • Publisher name

    Springer

  • Place of publication

    Dordrecht

  • UT code for WoS chapter