Recursive terms in semantic programming

DOI10.1134/S0037446618060058zbMath1486.68041OpenAlexW2906234744MaRDI QIDQ1731392

D. I. Sviridenko, Sergei S. Goncharov

Publication date: 13 March 2019

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0037446618060058

zbMATH Keywords

conditional termcomputabilitysemantic programmingcomputability over abstract structuresrestricted quantifierhereditary finite listhereditary finite setrecursive term

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Applications of computability and recursion theory (03D80) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (5)

Definable Subsets of Polynomial-Time Algebraic Structures ⋮ Unnamed Item ⋮ The expressiveness of looping terms in the semantic programming ⋮ On termination of transactions over semantic document models ⋮ On decidability of list structures

Cites Work

• On the complexity of formulas in semantic programming
• Conditional terms in semantic programming
• Σ-programming
• Data models and languages for their description
• S-Subsets of Natural Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recursive terms in semantic programming