期刊
SIBERIAN MATHEMATICAL JOURNAL
卷 58, 期 5, 页码 794-800出版社
MAIK NAUKA/INTERPERIODICA/SPRINGER
DOI: 10.1134/S0037446617050068
关键词
formula; term; restricted quantifier; Delta(0)-formula; Sigma-formula; semantic programming; computability; computability over abstract structures; conditional term
类别
资金
- Russian Science Foundation [17-11-01176]
- Russian Science Foundation [17-11-01176] Funding Source: Russian Science Foundation
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据
分享论文
