FUNDAMENTALNAYA
I PRIKLADNAYA MATEMATIKA
(FUNDAMENTAL AND APPLIED MATHEMATICS)
1999, VOLUME 5, NUMBER 3, PAGES 903-926
A. D. Yashin
Abstract
View as HTML
View as gif image
View as LaTeX source
The classification theorem for the family of all Novikov complete extensions
of the intuitionistic propositional logic in the language containing a single
additional constant is proved. The algorithmic problem of
the conservativeness of calculi in this enriched language
over intuitionistic
propositional logic is established to be decidable.
All articles are published in Russian.
| Main page | Contents of the journal | News | Search |
Location: http://mech.math.msu.su/~fpm/eng/99/993/99319t.htm
Last modified: November 11, 1999