On Algorithms Related to Expressibility of Functions of Diagonalizable Algebras

RUSU, Andrei; RUSU, Elena

dc.contributor.author	RUSU, Andrei
dc.contributor.author	RUSU, Elena
dc.date.accessioned	2022-01-10T10:18:54Z
dc.date.available	2022-01-10T10:18:54Z
dc.date.issued	2021
dc.identifier.citation	RUSU, Andrei, RUSU, Elena. On Algorithms Related to Expressibility of Functions of Diagonalizable Algebras. In: Algorithms as a Basis of Modern Applied Mathematics. Studies in Fuzziness and Soft Computing, 2021, V. 404, pp. 257–277. ISBN 978-3-030-61334-1.	en_US
dc.identifier.isbn	978-3-030-61334-1
dc.identifier.uri	https://doi.org/10.1007/978-3-030-61334-1_13
dc.identifier.uri	http://repository.utm.md/handle/5014/18712
dc.description	Access full text: https://doi.org/10.1007/978-3-030-61334-1_13	en_US
dc.description.abstract	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.	en_US
dc.language.iso	en	en_US
dc.publisher	Springer Nature Switzerland	en_US
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.subject	diagonalizable algebra	en_US
dc.subject	provability logic	en_US
dc.subject	functions	en_US
dc.subject	problems	en_US
dc.subject	iterative post algebra	en_US
dc.subject	post algebra	en_US
dc.subject	function algebra	en_US
dc.subject	algebra	en_US
dc.subject	clone problems	en_US
dc.title	On Algorithms Related to Expressibility of Functions of Diagonalizable Algebras	en_US
dc.type	Book chapter	en_US