Sciact
  • EN
  • RU

The Existence of Primitive Recursive Structures Full article

Conference Crossroads of Computability and Logic: Insights, Inspirations, and Innovations: 21st Conference on Computability in Europe (CiE 2025), Lisbon, Portugal
14-18 Jul 2025 , Лиссабон
Source Crossroads of Computability and Logic: Insights, Inspirations, and Innovations. 21st Conference on Computability in Europe, CiE 2025, Lisbon, Portugal, July 14–18, 2025, Proceedings
Compilation, Springer Cham. 2025. 512 c. ISBN 978-3-031-95907-3.
Output data Year: 2025, Volume: 15764, Pages: 119-132 Pages count : 14 DOI: 10.1007/978-3-031-95908-0_9
Tags computability, computable structure, punctual structure, primitive recurs
Authors Alaev Pavel E. 1,2
Affiliations
1 Novosibirsk State University, Novosibirsk, 630090, Russia
2 Sobolev Institute of Mathematics, pr. Koptuga 4, Novosibirsk, 630090, Russia

Funding (1)

1 Russian Science Foundation 23-11-00170

Abstract: We suggest a general, relatively simple criterion for the existence of a primitive recursive (p.r.) or punctual presentation of a given structure. As an example, we prove that every computable Abelian group with a computably enumerable linear basis has a p.r. presentation. A series of other examples is found.
Cite: Alaev P.E.
The Existence of Primitive Recursive Structures
In compilation Crossroads of Computability and Logic: Insights, Inspirations, and Innovations. 21st Conference on Computability in Europe, CiE 2025, Lisbon, Portugal, July 14–18, 2025, Proceedings. – Springer Cham., 2025. – Т.15764. – C.119-132. – ISBN 978-3-031-95907-3. DOI: 10.1007/978-3-031-95908-0_9 OpenAlex
Dates:
Published online: Jun 20, 2025
Identifiers:
OpenAlex: W4411458813
Citing: Пока нет цитирований
Altmetrics: