Articolul precedent |
Articolul urmator |
684 0 |
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 | ||||||
|
||||||
Pag. 98-101 | ||||||
|
||||||
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 |
||||||
|
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>Izbaş, O.I.</dc:creator> <dc:creator>Rusu, A.G.</dc:creator> <dc:date>2014</dc:date> <dc:description xml:lang='en'>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. </dc:description> <dc:source>Conference of Mathematical Society of the Republic of Moldova (3) 98-101</dc:source> <dc:subject>expressibility of formulas</dc:subject> <dc:subject>model completeness</dc:subject> <dc:subject>provabilty logic</dc:subject> <dc:subject>Diagonalizable algebra</dc:subject> <dc:title>On absence of finite approximation relative to model completeness in the propositional provability logic</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>