|
This article is cited in 18 scientific papers (total in 18 papers)
Conditional terms in semantic programming
S. S. Goncharov Sobolev Institute of Mathematics, Novosibirsk, Russia
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.
Keywords:
formula, term, restricted quantifier, $\Delta_0$-formula, $\Sigma$-formula, semantic programming, computability, computability over abstract structures, conditional term.
Received: 06.06.2017
Citation:
S. S. Goncharov, “Conditional terms in semantic programming”, Sibirsk. Mat. Zh., 58:5 (2017), 1026–1034; Siberian Math. J., 58:5 (2017), 794–800
Linking options:
https://www.mathnet.ru/eng/smj2916 https://www.mathnet.ru/eng/smj/v58/i5/p1026
|
Statistics & downloads: |
Abstract page: | 205 | Full-text PDF : | 63 | References: | 30 | First page: | 3 |
|