Form of presentation | Articles in international journals and collections |
Year of publication | 2009 |
|
Kalimullin Iskander Shagitovich, author
|
Bibliographic description in the original language |
Kalimullin I. Sh., Enumeration degrees and enumerability of families // Journal
of Logic and Computation. - 2009. - V.19, - № 1. - P. 151-158.
|
Place of publication |
Оксфорд |
The name of the journal |
J LOGIC COMPUT
|
Publishing house |
Oxford Press |
Please use this ID to quote from or refer to the card |
https://repository.kpfu.ru/eng/?p_id=15811&p_lang=2 |
Full metadata record |
Field DC |
Value |
Language |
dc.contributor.author |
Kalimullin Iskander Shagitovich |
ru_RU |
dc.date.accessioned |
2009-01-01T00:00:00Z |
ru_RU |
dc.date.available |
2009-01-01T00:00:00Z |
ru_RU |
dc.date.issued |
2009 |
ru_RU |
dc.identifier.citation |
Kalimullin I. Sh., Enumeration degrees and enumerability of families // Journal
of Logic and Computation. - 2009. - V.19, - № 1. - P. 151-158.
|
ru_RU |
dc.identifier.uri |
https://repository.kpfu.ru/eng/?p_id=15811&p_lang=2 |
ru_RU |
dc.description.abstract |
J LOGIC COMPUT |
ru_RU |
dc.language.iso |
ru |
ru_RU |
dc.publisher |
Oxford Press |
ru_RU |
dc.title |
Kalimullin I. Sh., Enumeration degrees and enumerability of families // Journal
of Logic and Computation. - 2009. - V.19, - № 1. - P. 151-158.
|
ru_RU |
dc.type |
Articles in international journals and collections |
ru_RU |
|