Conditional terms in semantic programming

DOI10.1134/S0037446617050068zbMath1420.03059OpenAlexW2765463448MaRDI QIDQ1694705

Sergei S. Goncharov

Publication date: 6 February 2018

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

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

zbMATH Keywords

termconditional termcomputabilityformulasemantic programming\(\Sigma\)-formula\(\Delta_0\)-formulacomputability over abstract structuresrestricted quantifier

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Related Items (9)

On the complexity of formulas in semantic programming ⋮ Definable Subsets of Polynomial-Time Algebraic Structures ⋮ Unnamed Item ⋮ Recursive terms in semantic programming ⋮ Locally simple models construction: methodology and practice ⋮ The expressiveness of looping terms in the semantic programming ⋮ On termination of transactions over semantic document models ⋮ Logical language of description of polynomial computing ⋮ On decidability of list structures

Cites Work

• Σ-programming
• 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
• Unnamed Item

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