Admissibility, compatibility, and deducibility in first-order sequent logics
Close
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
965 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)
Algebra (413)
Software (302)
SM ISO690:2012
LYALETSKI, 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

Admissibility, compatibility, and deducibility in first-order sequent logics
CZU: 512.54.05:004.42.021

Pag. 289-303

Lyaletski Alexander
 
Taras Shevchenko National University of Kyiv
 
 
Disponibil în IBN: 26 noiembrie 2015


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

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-40691</doi_batch_id>
<timestamp>1718022311</timestamp>
<depositor>
<depositor_name>Information Society Development Instiute, Republic of Moldova</depositor_name>
<email_address>[email protected]</email_address>
</depositor>
</head>
<body>
<journal>
<journal_metadata>
<full_title>Computer Science Journal of Moldova</full_title>
<issn media_type='print'>15614042</issn>
</journal_metadata>
<journal_issue>
<publication_date media_type='print'>
<year>2015</year>
</publication_date>
<issue>3(69)</issue>
</journal_issue>
<journal_article publication_type='full_text'><titles>
<title>Admissibility, compatibility, and deducibility in first-order sequent logics</title>
</titles>
<contributors>
<person_name sequence='first' contributor_role='author'>
<given_name>Alexander</given_name>
<surname>Lyaletski</surname>
</person_name>
</contributors>
<publication_date media_type='print'>
<year>2015</year>
</publication_date>
<pages>
<first_page>289</first_page>
<last_page>303</last_page>
</pages>
</journal_article>
</journal>
</body>
</doi_batch>