On existential expressibility of formulas in the simplest non-trivial super-intuitionistic propositional logic

RUSU, Andrei; RUSU, Elena

dc.contributor.author	RUSU, Andrei
dc.contributor.author	RUSU, Elena
dc.date.accessioned	2020-10-07T10:27:08Z
dc.date.available	2020-10-07T10:27:08Z
dc.date.issued	2017
dc.identifier.citation	RUSU, Andrei, RUSU, Elena. On existential expressibility of formulas in the simplest non-trivial super-intuitionistic propositional logic. In: Conference of Mathematical Society of the Republic of Moldova. 4, 28 iunie - 2 iulie 2017, Chişinău. Chişinău, 2017, pp. 153-156. ISBN 978-9975-71-915-5.	en_US
dc.identifier.isbn	978-9975-71-915-5
dc.identifier.uri	http://repository.utm.md/handle/5014/10514
dc.description.abstract	We consider the well-known 3-valued extension of the intuitionistic propositional logic [1] and examine the conditions for o system of formulas to be complete with respect to existential expressibility of formulas considered earlier by A. V. Kuznetsov [2]. It was established that there exists a relative simple algorithm to determine whether a system of formulas is complete relative to existential expressibility of formulas in the 3-valued extension of the intuitionistic propositional logic.	en_US
dc.language.iso	en	en_US
dc.publisher	Institutul de Matematică şi Informatică al AŞM	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	intuitionistic logic	en_US
dc.subject	existential expressibility	en_US
dc.subject	super-intuitionistic logic	en_US
dc.title	On existential expressibility of formulas in the simplest non-trivial super-intuitionistic propositional logic	en_US
dc.type	Article	en_US