Authors: Izbaş Olga,
Rusu Andrei
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$.
Olga Izbash
Institute of Mathematics and Computer Science
Academy of Sciences of Moldova
E-mail:
Andrei Rusu
Information Society Development Institute
Academy of Sciences of Moldova
E-mail:
Ovidius University of Constanta
Dep. of Mathematics and Informatics
E-mail:
Fulltext

–
0.08 Mb