| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 718 5 |
| Ultima descărcare din IBN: 2024-03-10 14:16 |
 SM ISO690:2012CUCU, Ion. A test for completeness with respect to implicit reducibility in the chain super-intutionistic logics. In: Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2006, nr. 1(50), pp. 23-30. ISSN 1024-7696. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica | ||||||
| Numărul 1(50) / 2006 / ISSN 1024-7696 /ISSNe 2587-4322 | ||||||
|
||||||
| MSC 2010: 16D80, 16D90, 16D20 | ||||||
| Pag. 23-30 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
We examine chain logics C2,C3, . . . , which are intermediary between classical and intuitionistic logics. The paper contains the criterion for recognition of completeness with respect to implicit reducibility in the logic Cm, for any m = 2, 3, . . . . The criterion is based on 13 closed pre-complete classes of formulas. |
||||||
| Cuvinte-cheie Chain intermediate logic, pseudo-Boolean algebra, implicit reducibility, expressibility, centralizer. |
||||||
|
|
|
|
