Conditional terms in semantic programming | Sciact - Система учета научной деятельности ИМ СО РАН

Conditional terms in semantic programming Научная публикация

Журнал

Siberian Mathematical Journal
ISSN: 0037-4466 , E-ISSN: 1573-9260

Вых. Данные

Год: 2017, Том: 58, Номер: 5, Страницы: 794-800 Страниц : 7 DOI: 10.1134/S0037446617050068

Ключевые слова

computability; computability over abstract structures; conditional term; formula; restricted quantifier; semantic programming; term; Δ0-formula; Σ-formula

Авторы

Goncharov S.S. ^1,2

Организации

1	Sobolev Institute of Mathematics Novosibirsk State University, Novosibirsk, Russian Federation
2	Novosibirsk State University

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.

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

Web of science:	WOS:000413438200006
Scopus:	2-s2.0-85032035771
OpenAlex:	W2765463448

БД	Цитирований
Scopus	14
OpenAlex	15
Web of science	11