Recursive Terms in Semantic Programming Full article

Journal	Siberian Mathematical Journal ISSN: 0037-4466 , E-ISSN: 1573-9260
Output data	Year: 2018, Volume: 59, Number: 6, Pages: 1014-1023 Pages count : 10 DOI: 10.1134/s0037446618060058
Tags	computability; computability over abstract structures; conditional term; formula; hereditary finite list; hereditary finite set; model; recursive term; restricted quantifier; semantic programming; term; Δ-formula; Δ0-formula; Σ-formula
Authors	Goncharov S.S. 1 , Sviridenko D.I. 1
Affiliations	1 Sobolev Institute of Mathematics