Articolul precedent |
Articolul urmator |
934 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 |
|||||||
|
DataCite XML Export
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'> <creators> <creator> <creatorName>Rusu, A.G.</creatorName> <affiliation>Universitatea „Ovidius“, Constanţa, România</affiliation> </creator> <creator> <creatorName>Rusu, E.</creatorName> <affiliation>Universitatea Tehnică a Moldovei, Moldova, Republica</affiliation> </creator> </creators> <titles> <title xml:lang='en'>On existential expressibility of formulas in the simplest non-trivial super-intuitionistic propositional logic</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2017</publicationYear> <relatedIdentifier relatedIdentifierType='ISBN' relationType='IsPartOf'>978-9975-71-915-5</relatedIdentifier> <subjects> <subject>Intuitionistic logic</subject> <subject>existential expressibility</subject> <subject>super-intuitionistic logic</subject> </subjects> <dates> <date dateType='Issued'>2017</date> </dates> <resourceType resourceTypeGeneral='Text'>Conference Paper</resourceType> <descriptions> <description xml:lang='en' descriptionType='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. </description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>