Количество конечно аксиоматизируемых пополнений.
Sibirskij matematiceskij zurnal (1991)
- Volume: 32, Issue: 1, page 174-178
- ISSN: 0037-4466; 1573-9260/e
Access Full Article
top
How to cite
topЗаурбеков, С.С.. "Количество конечно аксиоматизируемых пополнений.." Sibirskij matematiceskij zurnal 32.1 (1991): 174-178. <http://eudml.org/doc/63382>.
@article{Заурбеков1991,
author = {Заурбеков, С.С.},
journal = {Sibirskij matematiceskij zurnal},
keywords = {algorithmic complexity of classes of sentences; small hierarchy of arithmetical sets; finitely axiomatizable theories},
language = {rus},
number = {1},
pages = {174-178},
publisher = {Izd. AN SSSR},
title = {Количество конечно аксиоматизируемых пополнений.},
url = {http://eudml.org/doc/63382},
volume = {32},
year = {1991},
}
TY - JOUR
AU - Заурбеков, С.С.
TI - Количество конечно аксиоматизируемых пополнений.
JO - Sibirskij matematiceskij zurnal
PY - 1991
PB - Izd. AN SSSR
VL - 32
IS - 1
SP - 174
EP - 178
LA - rus
KW - algorithmic complexity of classes of sentences; small hierarchy of arithmetical sets; finitely axiomatizable theories
UR - http://eudml.org/doc/63382
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.