| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 961 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ă (413) |
| Programe. Software (301) |
 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 |
||||||
|
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-40691</cfResPublId> <cfResPublDate>2015-11-24</cfResPublDate> <cfVol>69</cfVol> <cfIssue>3</cfIssue> <cfStartPage>289</cfStartPage> <cfISSN>1561-4042</cfISSN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/40691</cfURI> <cfTitle cfLangCode='EN' cfTrans='o'>Admissibility, compatibility, and deducibility in first-order sequent logics</cfTitle> <cfKeyw cfLangCode='EN' cfTrans='o'>First-order classical logic; first-order intuitionistic logic; first-order modal logic; sequent calculus; deducibility; admissibility; compatibility; coextensivity; validity</cfKeyw> <cfAbstr cfLangCode='EN' cfTrans='o'>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. </cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId> <cfStartDate>2015-11-24T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId> <cfStartDate>2015-11-24T24:00:00</cfStartDate> </cfResPubl_Class> <cfPers_ResPubl> <cfPersId>ibn-person-46089</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2015-11-24T24:00:00</cfStartDate> </cfPers_ResPubl> </cfResPubl> <cfPers> <cfPersId>ibn-Pers-46089</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-46089-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2015-11-24T24:00:00</cfStartDate> <cfFamilyNames>Lyaletski</cfFamilyNames> <cfFirstNames>Alexander</cfFirstNames> </cfPersName_Pers> </cfPers> </CERIF>
|
|
|
