|
This article is cited in 9 scientific papers (total in 9 papers)
Recursive terms in semantic programming
S. S. Goncharov, D. I. Sviridenko Sobolev Institute of Mathematics, Novosibirsk, Russia
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 $\Delta$-definable in the basic language.
Keywords:
formula, term, restricted quantifier, $\Delta_0$-formula, $\Delta$-formula, $\Sigma$-formula, semantic programming, computability, computability over abstract structures, conditional term, recursive term, model, hereditary finite list, hereditary finite set.
Received: 17.03.2018
Citation:
S. S. Goncharov, D. I. Sviridenko, “Recursive terms in semantic programming”, Sibirsk. Mat. Zh., 59:6 (2018), 1279–1290; Siberian Math. J., 59:6 (2018), 1014–1023
Linking options:
https://www.mathnet.ru/eng/smj3043 https://www.mathnet.ru/eng/smj/v59/i6/p1279
|
Statistics & downloads: |
Abstract page: | 362 | Full-text PDF : | 107 | References: | 46 | First page: | 10 |
|