On completeness as to &not;-expressibility in a 4-valued provability logic

Rusu Andrei; Rusu Elena

Articolul precedent

Articolul urmator

819

Ultima descărcare din IBN:
2023-05-31 18:44

SM ISO690:2012

RUSU, Andrei, RUSU, Elena. On completeness as to ¬-expressibility in a 4-valued provability logic. In: Proceedings IMCS-55: The Fifth Conference of Mathematical Society of the Republic of Moldova, 28 septembrie - 1 octombrie 2019, Chișinău. Chișinău, Republica Moldova: "VALINEX" SRL, 2019, pp. 142-145. ISBN 978-9975-68-378-4.

EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core

Proceedings IMCS-55 2019

Conferința "Conference of Mathematical Society of the Republic of Moldova"
Chișinău, Moldova, 28 septembrie - 1 octombrie 2019

On completeness as to ¬-expressibility in a 4-valued provability logic

Pag. 142-145

Rusu Andrei¹², Rusu Elena³

¹ Vladimir Andrunachievici Institute of Mathematics and Computer Science,
² Ovidius University, Constanța,
³ Technical University of Moldova

Disponibil în IBN: 28 noiembrie 2019

Descarcă PDF

Rezumat

The simplest non-trivial 4-valued extension GL4 of the propositional provability logic GL is considered together with the notion of ¬-expressibility of formulas in GL. The necessary and sufficient conditions when a system of formulas of GL4 is complete relative to ¬-expressibility are found out which is formulated in terms of classes formulas that are pre-complete relative to ¬-expressibility.

Cuvinte-cheie
Provability logic, expressibility of formulas, completeness relative to ¬-expressibility

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-88734</doi_batch_id>
<timestamp>1714170180</timestamp>
<depositor>
<depositor_name>Information Society Development Instiute, Republic of Moldova</depositor_name>
<email_address>idsi@asm.md</email_address>
</depositor>
</head>
<body>
<collection>
<collection_metadata>
<full_title>Proceedings IMCS-55</full_title>
</collection_metadata>
<collection_issue>
<publication_date media_type='print'>
<year>2019</year>
</publication_date>
<isbn>978-9975-68-378-4</isbn>
</collection_issue>
<collection_article publication_type='full_text'><titles>
<title>On completeness as to &not;-expressibility in a 4-valued provability logic</title>
</titles>
<contributors>
<person_name sequence='first' contributor_role='author'>
<given_name>Andrei</given_name>
<surname>Rusu</surname>
</person_name>
<person_name sequence='additional' contributor_role='author'>
<given_name>Elena</given_name>
<surname>Rusu</surname>
</person_name>
</contributors>
<publication_date media_type='print'>
<year>2019</year>
</publication_date>
<pages>
<first_page>142</first_page>
<last_page>145</last_page>
</pages>
</collection_article>
</collection>
</body>
</doi_batch>