Conditional terms in semantic programming Full article
| Journal |
Siberian Mathematical Journal
ISSN: 0037-4466 , E-ISSN: 1573-9260 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2017, Volume: 58, Number: 5, Pages: 794-800 Pages count : 7 DOI: 10.1134/S0037446617050068 | ||||
| Tags | computability; computability over abstract structures; conditional term; formula; restricted quantifier; semantic programming; term; Δ0-formula; Σ-formula | ||||
| Authors |
|
||||
| Affiliations |
|
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. © 2017, Pleiades Publishing, Ltd.
Cite:
Goncharov S.S.
Conditional terms in semantic programming
Siberian Mathematical Journal. 2017. V.58. N5. P.794-800. DOI: 10.1134/S0037446617050068 WOS Scopus OpenAlex
Conditional terms in semantic programming
Siberian Mathematical Journal. 2017. V.58. N5. P.794-800. DOI: 10.1134/S0037446617050068 WOS Scopus OpenAlex
Identifiers:
| Web of science: | WOS:000413438200006 |
| Scopus: | 2-s2.0-85032035771 |
| OpenAlex: | W2765463448 |