On some classes of formulas in S5 which are pre-complete relative to existential expressibility

RUSU, Andrei; RUSU, Elena

dc.contributor.author	RUSU, Andrei
dc.contributor.author	RUSU, Elena
dc.date.accessioned	2024-06-14T12:19:26Z
dc.date.available	2024-06-14T12:19:26Z
dc.date.issued	2023
dc.identifier.citation	RUSU, Andrei, RUSU, Elena. On some classes of formulas in S5 which are pre-complete relative to existential expressibility. In: Computer Science Journal of Moldova, 2023, vol. 31, nr.3, pp. 395-408. ISSN 1561-4042.	en_US
dc.identifier.issn	1561-4042
dc.identifier.uri	https://doi.org/10.56415/csjm.v31.21
dc.identifier.uri	http://repository.utm.md/handle/5014/27418
dc.description.abstract	Existential expressibility for all k-valued functions was proposed by A. V. Kuznetsov and later was investigated in more details by S. S. Marchenkov. In the present paper, we consider existential expressibility in the case of formulas defined by a logical calculus and find out some conditions for a system of formulas to be closed relative to existential expressibility. As a consequence, it has been established some pre-complete as to existential expressibility classes of formulas in some finite extensions of the paraconsistent modal logic S5.	en_US
dc.language.iso	en	en_US
dc.publisher	Institutul de Matematică şi Informatică "Vladimir Andrunachievici"	en_US
dc.relation.ispartofseries	Computer Science Journal of Moldova;2023, vol. 31, nr. 3
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.subject	paraconsistent logic	en_US
dc.subject	existential expressibility	en_US
dc.subject	logical calculi	en_US
dc.title	On some classes of formulas in S5 which are pre-complete relative to existential expressibility	en_US
dc.type	Article	en_US