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

Rusu Andrei; Rusu Elena

Articolul precedent

Articolul urmator

809

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

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'>
<dc:creator>Rusu, A.G.</dc:creator>
<dc:creator>Rusu, E.</dc:creator>
<dc:date>2019</dc:date>
<dc:description xml:lang='en'><p>The simplest non-trivial 4-valued extension GL4 of the propositional provability logic GL is considered together with the notion of &not;-expressibility of formulas in GL. The necessary and sufficient conditions when a system of formulas of GL4 is complete relative to &not;-expressibility are found out which is formulated in terms of classes formulas that are pre-complete relative to &not;-expressibility.</p></dc:description>
<dc:source>Proceedings IMCS-55 () 142-145</dc:source>
<dc:subject>Provability logic</dc:subject>
<dc:subject>expressibility of formulas</dc:subject>
<dc:subject>completeness relative to ¬-expressibility</dc:subject>
<dc:title>On completeness as to &not;-expressibility in a 4-valued provability logic</dc:title>
<dc:type>info:eu-repo/semantics/article</dc:type>
</oai_dc:dc>