Have a personal or library account? Click to login
Infinitely Many Precomplete with Respect to Parametric Expressibility Classes of Formulas in a Provability Logic of Propositions Cover

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

Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică
Volume 22 (2014): Issue 1 (March 2014)
By: Andrei Rusu  
Open Access
|Dec 2014

Authors

DOI: https://doi.org/10.2478/auom-2014-0020 | Journal eISSN: 1844-0835 | Journal ISSN: 1224-1784
Journal RSS Feed
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:
parametric expressibility of formulas,
modal logic,
diagonalizable algebra,
precomplete classes of formulas with respect to parametric expressibility,
extensions of logics
Related subjects:
Mathematics,
General mathematics

© 2014 Andrei Rusu, published by Ovidius University of Constanta
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous articleVolume 22 (2014): Issue 1 (March 2014)Next article