Conditional terms in semantic programming

DOI10.1134/S0037446617050068MaRDI QIDQ1694705zbMATH OpenOpenAlexFDO

Authors S. 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

termcomputabilityformulasemantic programmingconditional term\(\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)

Recommendations

• Recursive terms in semantic programming
• scientific article; zbMATH DE number 4106288
• On the complexity of formulas in semantic programming
• scientific article; zbMATH DE number 26616
• The expressiveness of looping terms in the semantic programming

Cites work

• scientific article; zbMATH DE number 3857076 (Why is no real title available?)
• scientific article; zbMATH DE number 4139721 (Why is no real title available?)
• scientific article; zbMATH DE number 3921954 (Why is no real title available?)
• scientific article; zbMATH DE number 3980456 (Why is no real title available?)
• scientific article; zbMATH DE number 4007715 (Why is no real title available?)
• scientific article; zbMATH DE number 4047058 (Why is no real title available?)
• scientific article; zbMATH DE number 4049008 (Why is no real title available?)
• scientific article; zbMATH DE number 4051580 (Why is no real title available?)
• scientific article; zbMATH DE number 4055021 (Why is no real title available?)
• scientific article; zbMATH DE number 1302869 (Why is no real title available?)
• scientific article; zbMATH DE number 934359 (Why is no real title available?)
• HF-computability
• S-Subsets of Natural Numbers
• Σ-programming

Cited in

(11)

• Definable Subsets of Polynomial-Time Algebraic Structures
• Recursive terms in semantic programming
• On the complexity of formulas in semantic programming
• scientific article; zbMATH DE number 4106288 (Why is no real title available?)
• Locally simple models construction: methodology and practice
• Semantics for conditional literals via the SM operator
• The expressiveness of looping terms in the semantic programming
• On decidability of list structures
• Logical language of description of polynomial computing
• Some questions on polynomially computable representations for generating grammars and Backus-Naur forms
• On termination of transactions over semantic document models

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1694705)