FINITE ∀-DEFINABILITY AND COMPUTABILITY OF DATA MODELS
It is established that the computable representability of the model is equivalent to the finite universal definability of some of its finite enrichment.
Сведения
- Опубликовано
- 2023 · Т. 67, № 1, С. 47-51
- Язык
- Английский
- ISSN
- 2010-7269
- Издатель
- V.I.Romanovskiy Institute of Mathematics