<?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>Institutul de Matematică şi Informatică al AŞM, Moldova, Republica</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'>Infinitely many functional pre-complete classes of formulas in the propositional provability intuitionistic logic</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2007</publicationYear>
<relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1024-7696</relatedIdentifier>
<subjects>
<subject>Provability-intuitionistic logic</subject>
<subject>functional expressibility</subject>
<subject>pre-complete classes of formulas.</subject>
</subjects>
<dates>
<date dateType='Issued'>2007-04-03</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Journal article</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'>We consider the propositional provability intuitionistic logic I
, intro-
duced by A.V. Kuznetsov [2]. We prove that there are infinitely many classes of
formulas in the calculus of I
, which are pre-complete with respect to functional ex-
pressibility in I
. This result is stronger than an ealier one stated by the author in
[1].</description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>