KFU. Card publication. Complexity of ?n0-classifications for definable subsets

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

COMPLEXITY OF ?N0-CLASSIFICATIONS FOR DEFINABLE SUBSETS

Form of presentation

Articles in international journals and collections

Year of publication

2023

Язык

английский

Authors, employees of KFU

Zubkov Maksim Vitalevich, author

Bibliographic description in the original language

Aleksandrova S, Bazhenov N, Zubkov M, Complexity of ?n0-classifications for definable subsets//ARCHIVE FOR MATHEMATICAL LOGIC. - 2023. - Vol.62, Is.1-2. - P.239-256.

Keywords

clfssification, definable subset, linear order

The name of the journal

Archive for Mathematical Logic

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=291591&p_lang=2

Full metadata record

Field DC	Value	Language
dc.contributor.author	Zubkov Maksim Vitalevich	ru_RU
dc.date.accessioned	2023-01-01T00:00:00Z	ru_RU
dc.date.available	2023-01-01T00:00:00Z	ru_RU
dc.date.issued	2023	ru_RU
dc.identifier.citation	Aleksandrova S, Bazhenov N, Zubkov M, Complexity of ?n0-classifications for definable subsets//ARCHIVE FOR MATHEMATICAL LOGIC. - 2023. - Vol.62, Is.1-2. - P.239-256.	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=291591&p_lang=2	ru_RU
dc.description.abstract	Archive for Mathematical Logic	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	clfssification	ru_RU
dc.subject	definable subset	ru_RU
dc.subject	linear order	ru_RU
dc.title	Complexity of ?n0-classifications for definable subsets	ru_RU
dc.type	Articles in international journals and collections	ru_RU