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”

Floppy Logic as a Generalization of Standard Boolean Logic

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21260%2F20%3A00344283" target="_blank" >RIV/68407700:21260/20:00344283 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.14311/NNW.2020.30.014" target="_blank" >https://doi.org/10.14311/NNW.2020.30.014</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.14311/NNW.2020.30.014" target="_blank" >10.14311/NNW.2020.30.014</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Floppy Logic as a Generalization of Standard Boolean Logic

  • Original language description

    The topic of this article is floppy logic, a new multi-valued logic. Floppy logic is related to fuzzy logic and the theory of probability, but it also has interesting links to probability logic and standard Boolean logic. It provides a consistent and simple theory that is easy to apply in practice. This article examines the isomorphism theorem, which plays an important role in floppy logic. The theorem is described and proved. The most important consequences of the isomorphism theorem are: 1. All statements which are equivalent in standard Boolean logic are also equivalent in floppy logic. 2. Floppy logic has all the properties of standard Boolean logic which can be formulated as an equivalence. These include, for example, distributivity, the contradiction law, the law of excluded middle, and others. The article mainly examines floppy implication. We show that floppy implication does not satisfy Adam’s Thesis and that floppy logic is not limited by Lewis’ triviality result. We also present a range of inference rules which are generalizations of modus ponens and modus tollens. These rules hold in floppy logic, and of course, also apply to standard Boolean logic. All these results lead us to the notion that floppy logic is a many-valued generalization of standard Boolean logic.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10102 - Applied mathematics

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2020

  • 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

  • Name of the periodical

    Neural Network World

  • ISSN

    1210-0552

  • e-ISSN

  • Volume of the periodical

    30

  • Issue of the periodical within the volume

    3

  • Country of publishing house

    CZ - CZECH REPUBLIC

  • Number of pages

    17

  • Pages from-to

    193-209

  • UT code for WoS article

    000572850100004

  • EID of the result in the Scopus database

    2-s2.0-85092418146