|
|
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2015, номер 3, страницы 110–113
(Mi basm402)
|
 |
|
 |
Short communications
On the absence of finite approximation relative to model completeness in propositional provability logic
Olga Izbasha, Andrei Rusubc
a Institute of Mathematics and Computer Science, Academy of Sciences of Moldova
b Ovidius University of Constanţa, Dep. of Mathematics and Informatics
c Information Society Development Institute, Academy of Sciences of Moldova
Аннотация:
In the present paper we consider the expressibility of formulas in the provability logic $GL$ and related to it questions of the model completeness of system of formulas. We prove the absence of a finite approximation relative to model completeness in $GL$.
Ключевые слова и фразы:
expressibility, model completeness, provabilty logic, diagonalizable algebra.
Поступила в редакцию: 10.09.2015
Образец цитирования:
Olga Izbash, Andrei Rusu, “On the absence of finite approximation relative to model completeness in propositional provability logic”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2015, no. 3, 110–113
Образцы ссылок на эту страницу:
https://www.mathnet.ru/rus/basm402 https://www.mathnet.ru/rus/basm/y2015/i3/p110
|
| Статистика просмотров: |
| Страница аннотации: | 344 | | PDF полного текста: | 46 | | Список литературы: | 30 |
|
Цитирование в формате AMSBIB
Обратная связь: