Journal
SIBERIAN MATHEMATICAL JOURNAL
Volume 58, Issue 5, Pages 794-800Publisher
MAIK NAUKA/INTERPERIODICA/SPRINGER
DOI: 10.1134/S0037446617050068
Keywords
formula; term; restricted quantifier; Delta(0)-formula; Sigma-formula; semantic programming; computability; computability over abstract structures; conditional term
Categories
Funding
- Russian Science Foundation [17-11-01176]
- Russian Science Foundation [17-11-01176] Funding Source: Russian Science Foundation
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
