Articolul precedent |
Articolul urmator |
935 3 |
Ultima descărcare din IBN: 2020-10-07 12:04 |
SM ISO690:2012 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, 28 iunie - 2 iulie 2017, Chişinău. Chişinău: Centrul Editorial-Poligrafic al USM, 2017, 4, pp. 153-156. ISBN 978-9975-71-915-5. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Conference of Mathematical Society of the Republic of Moldova 4, 2017 |
|||||||
Conferința "Conference of Mathematical Society of the Republic of Moldova" Chişinău, Moldova, 28 iunie - 2 iulie 2017 | |||||||
|
|||||||
Pag. 153-156 | |||||||
|
|||||||
Descarcă PDF | |||||||
Rezumat | |||||||
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. |
|||||||
Cuvinte-cheie Intuitionistic logic, existential expressibility, super-intuitionistic logic |
|||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Rusu, A.G.</dc:creator> <dc:creator>Rusu, E.</dc:creator> <dc:date>2017</dc:date> <dc:description xml:lang='en'>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. </dc:description> <dc:source>Conference of Mathematical Society of the Republic of Moldova (4) 153-156</dc:source> <dc:subject>Intuitionistic logic</dc:subject> <dc:subject>existential expressibility</dc:subject> <dc:subject>super-intuitionistic logic</dc:subject> <dc:title>On existential expressibility of formulas in the simplest non-trivial super-intuitionistic propositional logic</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>