| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 934 3 |
| Ultima descărcare din IBN: 2017-04-26 13:07 |
| Căutarea după subiecte similare conform CZU |
| 512.54.05:004.42.021 (1) |
| Algebră (401) |
| Programe. Software (296) |
 SM ISO690:2012LYALETSKI, Alexander. Admissibility, compatibility, and deducibility in first-order sequent logics. In: Computer Science Journal of Moldova, 2015, nr. 3(69), pp. 289-303. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 3(69) / 2015 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 512.54.05:004.42.021 | ||||||
| Pag. 289-303 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
The paper is about the notions of admissibility and compat- ibility and their significance for deducibility in different sequent logics including first-order classical and intuitionistic ones both without and with equality and, possibly, with modal rules. Re- sults on the coextensivity of the proposed sequent calculi with usual Gentzen and Kanger sequent calculi as well as with their equality and modal extensions are given. |
||||||
| Cuvinte-cheie First-order classical logic, sequent calculus, admissibility, compatibility, validity, first-order intuitionistic logic, first-order modal logic, deducibility, coextensivity |
||||||
|
|
|
|
