Infinitely Many Precomplete with Respect to Parametric Expressibility Classes of Formulas in a Provability Logic of Propositions
By: Andrei Rusu
Abstract
In the present paper we consider a non-tabular extension L of the well-known propositional provability logic GL together with the notion of parametric expressibility of formulas in a logic proposed by A. V. Kuznetsov. We prove that there are infinitely many precomplete with respect to parametric expressibility classes of formulas in the above mentioned logic L.
Language: English
Page range: 247 - 255
Submitted on: Nov 1, 2013
Accepted on: Feb 1, 2014
Published on: Dec 10, 2014
Published by: Ovidius University of Constanta
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year
Keywords:
Related subjects:
© 2014 Andrei Rusu, published by Ovidius University of Constanta
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.