Recursive Terms in Semantic Programming

Сибирский математический журнал

S. S. Goncharov¹ 

[1] Sobolev Institute of Mathematics

关键词: formula;    term;    restricted quantifier;    Δ0-formula;    Δ-formula;    Σ-formula;    semantic programming;    computability;    computability over abstract structures;    conditional term;    recursive term;    model;    hereditary finite list;    hereditary finite set;   

DOI  :  10.1134/S0037446618060058

学科分类：数学（综合）

来源: Izdatel stvo Instituta Matematiki Rossiiskoi Akademii Nauk

【 摘 要 】

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 Δ-definable in the basic language.

【 授权许可】

CC BY