On absence of finite approximation relative to model completeness in the propositional provability logic

Izbash Olga; Rusu Andrei

Articolul precedent

Articolul urmator

668

SM ISO690:2012

IZBASH, Olga, RUSU, Andrei. On absence of finite approximation relative to model completeness in the propositional provability logic. In: Conference of Mathematical Society of the Republic of Moldova, 19-23 august 2014, Chișinău. Chișinău: "VALINEX" SRL, 2014, 3, pp. 98-101. ISBN 978-9975-68-244-2.

EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core

Conference of Mathematical Society of the Republic of Moldova
3, 2014

Conferința "Conference of Mathematical Society of the Republic of Moldova"
Chișinău, Moldova, 19-23 august 2014

On absence of finite approximation relative to model completeness in the propositional provability logic

Pag. 98-101

Izbash Olga¹, Rusu Andrei²³

¹ Institute of Mathematics and Computer Science ASM,
² Information Society Development Institute,
³ Ovidius University, Constanța

Disponibil în IBN: 9 octombrie 2017

Descarcă PDF

Rezumat

In the present paper we consider expressibility of formulas in the provability logic GL and related to it questions of model completeness of system of formulas. We prove the absence of finite approximation relative to model completeness in GL.

Cuvinte-cheie
expressibility of formulas, model completeness, provabilty logic, Diagonalizable algebra

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-54775</doi_batch_id>
<timestamp>1713272190</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>
</collection_metadata>
<collection_issue>
<publication_date media_type='print'>
<year>2014</year>
</publication_date>
<isbn>978-9975-68-244-2</isbn>
</collection_issue>
<collection_article publication_type='full_text'><titles>
<title>On absence of finite approximation relative to model completeness in the propositional provability logic</title>
</titles>
<contributors>
<person_name sequence='first' contributor_role='author'>
<given_name>Olga</given_name>
<surname>Izbaş</surname>
</person_name>
<person_name sequence='additional' contributor_role='author'>
<given_name>Andrei</given_name>
<surname>Rusu</surname>
</person_name>
</contributors>
<publication_date media_type='print'>
<year>2014</year>
</publication_date>
<pages>
<first_page>98</first_page>
<last_page>101</last_page>
</pages>
</collection_article>
</collection>
</body>
</doi_batch>