KFU. Card publication. Fixed point theorems for minimal numberings

FIXED POINT THEOREMS FOR MINIMAL NUMBERINGS

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. Fixed point theorems for minimal numberings. J. Logic Comput. 35:2 (2025), Art. № exad074. 15 pp.

Keywords

numbering, minimal numbering, fixed point, the recursion theorem, complete numbering, precomplete numbering

The name of the journal

Journal of Logic and Computation

URL

https://doi.org/10.1093/logcom/exad074

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. Fixed point theorems for minimal numberings. J. Logic Comput. 35:2 (2025), Art. № exad074. 15 pp.	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=290339&p_lang=2	ru_RU
dc.description.abstract	Journal of Logic and Computation	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	numbering	ru_RU
dc.subject	minimal numbering	ru_RU
dc.subject	fixed point	ru_RU
dc.subject	the recursion theorem	ru_RU
dc.subject	complete numbering	ru_RU
dc.subject	precomplete numbering	ru_RU
dc.title	Fixed point theorems for minimal numberings	ru_RU
dc.type	Articles in international journals and collections	ru_RU