| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 886 5 |
| Ultima descărcare din IBN: 2023-09-07 12:43 |
 SM ISO690:2012RUSU, Andrei. Infinitely many functional pre-complete classes of formulas in the propositional provability intuitionistic logic. In: Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2007, nr. 1(53), pp. 66-72. ISSN 1024-7696. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica | ||||||
| Numărul 1(53) / 2007 / ISSN 1024-7696 /ISSNe 2587-4322 | ||||||
|
||||||
| Pag. 66-72 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
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]. |
||||||
| Cuvinte-cheie Provability-intuitionistic logic, functional expressibility, pre-complete classes of formulas. |
||||||
|
Cerif XML Export
<?xml version='1.0' encoding='utf-8'?> <CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'> <cfResPubl> <cfResPublId>ibn-ResPubl-8409</cfResPublId> <cfResPublDate>2007-04-03</cfResPublDate> <cfVol>53</cfVol> <cfIssue>1</cfIssue> <cfStartPage>66</cfStartPage> <cfISSN>1024-7696</cfISSN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/8409</cfURI> <cfTitle cfLangCode='EN' cfTrans='o'>Infinitely many functional pre-complete classes of formulas in the propositional provability intuitionistic logic</cfTitle> <cfKeyw cfLangCode='EN' cfTrans='o'>Provability-intuitionistic logic; functional expressibility; pre-complete classes of formulas.</cfKeyw> <cfAbstr cfLangCode='EN' cfTrans='o'>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].</cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId> <cfStartDate>2007-04-03T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId> <cfStartDate>2007-04-03T24:00:00</cfStartDate> </cfResPubl_Class> <cfPers_ResPubl> <cfPersId>ibn-person-32760</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2007-04-03T24:00:00</cfStartDate> </cfPers_ResPubl> </cfResPubl> <cfPers> <cfPersId>ibn-Pers-32760</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-32760-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2007-04-03T24:00:00</cfStartDate> <cfFamilyNames>Rusu</cfFamilyNames> <cfFirstNames>Andrei</cfFirstNames> </cfPersName_Pers> </cfPers> </CERIF>
|
|
|
