Recursive Terms in Semantic Programming
- Авторлар: Goncharov S.S.1, Sviridenko D.I.1
-
Мекемелер:
- Sobolev Institute of Mathematics
- Шығарылым: Том 59, № 6 (2018)
- Беттер: 1014-1023
- Бөлім: Article
- URL: https://journals.rcsi.science/0037-4466/article/view/172093
- DOI: https://doi.org/10.1134/S0037446618060058
- ID: 172093
Дәйексөз келтіру
Аннотация
For constructing an enrichment of a language with restricted quantifiers, we extend the notion of term by the construction of the terms conditional and recursive with respect to lists. We show that the so-obtained extension of the language of formulas with restricted quantifiers over structures with hereditary finite lists is a conservative enrichment and the new terms are Δ-definable in the basic language.
Авторлар туралы
S. Goncharov
Sobolev Institute of Mathematics
Хат алмасуға жауапты Автор.
Email: s.s.goncharov@math.nsc.ru
Ресей, Novosibirsk
D. Sviridenko
Sobolev Institute of Mathematics
Email: s.s.goncharov@math.nsc.ru
Ресей, Novosibirsk
Қосымша файлдар
