Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică
Volume 22 (2014): Issue 1 (March 2014)
Open Access
Infinitely Many Precomplete with Respect to Parametric Expressibility Classes of Formulas in a Provability Logic of Propositions
Andrei Rusu
Andrei Rusu
| Dec 10, 2014
Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică
Volume 22 (2014): Issue 1 (March 2014)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Dec 10, 2014
Page range:
247 - 255
Received:
Nov 01, 2013
Accepted:
Feb 01, 2014
DOI:
https://doi.org/10.2478/auom-2014-0020
Keywords
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.