|
|
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2015, Number 3, Pages 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
Abstract:
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$.
Keywords and phrases:
expressibility, model completeness, provabilty logic, diagonalizable algebra.
Received: 10.09.2015
Citation:
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
Linking options:
https://www.mathnet.ru/eng/basm402 https://www.mathnet.ru/eng/basm/y2015/i3/p110
|
|
Citation in format AMSBIB
Contact us: