On absence of flnite approximation relative to model completeness in the propositional provability logic
Olga Izba, Andrei Rusu · 2014
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 flnite approximation relative to model completeness in GL.