Email this article Recursive Terms in Semantic Programming
- Authors: Goncharov S.S.1, Sviridenko D.I.1
-
Affiliations:
- Sobolev Institute of Mathematics
- Issue: Vol 59, No 6 (2018)
- Pages: 1014-1023
- Section: Article
- URL: https://journals.rcsi.science/0037-4466/article/view/172093
- DOI: https://doi.org/10.1134/S0037446618060058
- ID: 172093
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
S. S. Goncharov
Sobolev Institute of Mathematics
Author for correspondence.
Email: s.s.goncharov@math.nsc.ru
Russian Federation, Novosibirsk
D. I. Sviridenko
Sobolev Institute of Mathematics
Email: s.s.goncharov@math.nsc.ru
Russian Federation, Novosibirsk
Supplementary files
