Gradable logical values for knowlege representation
Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part X, Tome 241 (1997), pp. 135-149
Voir la notice de l'article provenant de la source Math-Net.Ru
The paper is devoted to the description of sequent calculuses with the possibility of comparison of Post's logics' sentences and to study their main properties. These calculuses may be applied for computer representation of knowedge.
@article{ZNSL_1997_241_a5,
author = {N. K. Kossovski and A. V. Tishkov},
title = {Gradable logical values for knowlege representation},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {135--149},
publisher = {mathdoc},
volume = {241},
year = {1997},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1997_241_a5/}
}
N. K. Kossovski; A. V. Tishkov. Gradable logical values for knowlege representation. Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part X, Tome 241 (1997), pp. 135-149. http://geodesic.mathdoc.fr/item/ZNSL_1997_241_a5/