Articolul precedent |
Articolul urmator |
348 6 |
Ultima descărcare din IBN: 2023-12-02 16:21 |
SM ISO690:2012 RUSU, Andrei, RUSU, Elena. On Algorithms Related to Expressibility of Functions of Diagonalizable Algebras. In: Studies in Fuzziness and Soft Computing, 5 aprilie 2021, Berlin. Berlin, Germania: Springer Science and Business Media Deutschland GmbH, 2021, pp. 257-277. ISSN 1434-9922. DOI: https://doi.org/10.1007/978-3-030-61334-1_13 |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Studies in Fuzziness and Soft Computing 2021 | |||||
Conferința "Studies in Fuzziness and Soft Computing" Berlin, Germania, 5 aprilie 2021 | |||||
|
|||||
DOI: https://doi.org/10.1007/978-3-030-61334-1_13 | |||||
Pag. 257-277 | |||||
|
|||||
Descarcă PDF | |||||
Rezumat | |||||
It is well known the connection of diagonalizable algebras with propositional provability logics. The notion of expressibility of functions and related algorithmic problems is very well studied in the case of boolean functions. We propose and analyse algorithms for detecting functional expressibility of functions of a 4-valued diagonalizable algebra and examine other problems connected to iterative algebras based on diagonalizable algebras. |
|||||
|