Email this article Conditional terms in semantic programming
- Authors: Goncharov S.S.1
-
Affiliations:
- Sobolev Institute of Mathematics Novosibirsk State University
- Issue: Vol 58, No 5 (2017)
- Pages: 794-800
- Section: Article
- URL: https://journal-vniispk.ru/0037-4466/article/view/171429
- DOI: https://doi.org/10.1134/S0037446617050068
- ID: 171429
Cite item
Open Access
Access granted
Subscription Access
Abstract
For constructing an enrichment of the language with restricted quantifiers, we extend the construction of conditional terms. 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.
About the authors
S. S. Goncharov
Sobolev Institute of Mathematics Novosibirsk State University
Author for correspondence.
Email: s.s.goncharov@math.nsc.ru
Russian Federation, Novosibirsk
Supplementary files
