KFU. Card publication. A family whose computable numberings are all complete

A FAMILY WHOSE COMPUTABLE NUMBERINGS ARE ALL COMPLETE

Form of presentation

Articles in international journals and collections

Year of publication

2025

Язык

английский

Authors, employees of KFU

Fayzrakhmanov Marat Khaydarovich, author

Bibliographic description in the original language

Faizrahmanov M. A family whose computable numberings are all complete. J. Logic Lang. Inf. 34:1-2 (2025), 155-167.

Keywords

computable numbering, complete numbering, arithmetical numbering, fixed point

The name of the journal

Journal of Logic, Language and Information

URL

https://doi.org/10.1007/s10849-025-09430-2

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

Field DC	Value	Language
dc.contributor.author	Fayzrakhmanov Marat Khaydarovich	ru_RU
dc.date.accessioned	2025-01-01T00:00:00Z	ru_RU
dc.date.available	2025-01-01T00:00:00Z	ru_RU
dc.date.issued	2025	ru_RU
dc.identifier.citation	Faizrahmanov M. A family whose computable numberings are all complete. J. Logic Lang. Inf. 34:1-2 (2025), 155-167.	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=313254&p_lang=2	ru_RU
dc.description.abstract	Journal of Logic, Language and Information	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	computable numbering	ru_RU
dc.subject	complete numbering	ru_RU
dc.subject	arithmetical numbering	ru_RU
dc.subject	fixed point	ru_RU
dc.title	A family whose computable numberings are all complete	ru_RU
dc.type	Articles in international journals and collections	ru_RU