<abstract xmlns="http://www.w3.org/1999/xhtml"><p>In the present paper we consider a non-tabular extension <italic>L</italic> of the well-known propositional provability logic <italic>GL</italic> 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 <italic>L</italic>.</p></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.

Infinitely Many Precomplete with Respect to Parametric Expressibility Classes of Formulas in a Provability Logic of Propositions

Department of Mathematics and Computer Science, Ovidius University of Constanta, Bdul Mamaia 124, 900527 Constanţa, România.

Information Society Development Institute, Academy of Sciences of Moldova, Str. Academiei 5A, MD2028 Chişinău, Republica Moldova.

Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

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...

Infinitely Many Precomplete with Respect to Parametric Expressibility Classes of Formulas in a Provability Logic of Propositions

Pubblicato online: 10 dic 2014

Pagine: 247 - 255

Ricevuto: 01 nov 2013

Accettato: 01 feb 2014

DOI: https://doi.org/10.2478/auom-2014-0020

Parole chiave
parametric expressibility of formulas, modal logic, diagonalizable algebra, precomplete classes of formulas with respect to parametric expressibility, extensions of logics

© 2014 Andrei Rusu

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Infinitely Many Precomplete with Respect to Parametric Expressibility Classes of Formulas in a Provability Logic of Propositions

Pubblicato online: 10 dic 2014

Pagine: 247 - 255

Ricevuto: 01 nov 2013

Accettato: 01 feb 2014

DOI: https://doi.org/10.2478/auom-2014-0020

Parole chiaveparametric expressibility of formulas, modal logic, diagonalizable algebra, precomplete classes of formulas with respect to parametric expressibility, extensions of logics

© 2014 Andrei Rusu

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Parole chiave
parametric expressibility of formulas, modal logic, diagonalizable algebra, precomplete classes of formulas with respect to parametric expressibility, extensions of logics