Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
885 5 |
Ultima descărcare din IBN: 2023-09-07 12:43 |
SM ISO690:2012 RUSU, 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. |
||||||
|
Crossref XML Export
<?xml version='1.0' encoding='utf-8'?> <doi_batch version='4.3.7' xmlns='http://www.crossref.org/schema/4.3.7' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.crossref.org/schema/4.3.7 http://www.crossref.org/schema/deposit/crossref4.3.7.xsd'> <head> <doi_batch_id>ibn-8409</doi_batch_id> <timestamp>1714526062</timestamp> <depositor> <depositor_name>Information Society Development Instiute, Republic of Moldova</depositor_name> <email_address>idsi@asm.md</email_address> </depositor> <registrant>Institutul de Matematică şi Informatică al AŞM</registrant> </head> <body> <journal> <journal_metadata> <full_title>Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica</full_title> <issn media_type='print'>10247696</issn> </journal_metadata> <journal_issue> <publication_date media_type='print'> <year>2007</year> </publication_date> <issue>1(53)</issue> </journal_issue> <journal_article publication_type='full_text'><titles> <title>Infinitely many functional pre-complete classes of formulas in the propositional provability intuitionistic logic</title> </titles> <contributors> <person_name sequence='first' contributor_role='author'> <given_name>Andrei</given_name> <surname>Rusu</surname> </person_name> </contributors> <publication_date media_type='print'> <year>2007</year> </publication_date> <pages> <first_page>66</first_page> <last_page>72</last_page> </pages> </journal_article> </journal> </body> </doi_batch>