On the complexity of formulas in semantic programming

zbMath1403.03061MaRDI QIDQ1615728

R. Smith

Publication date: 31 October 2018

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

semantic programminglist structures\(\Delta_0\)-formulaspolynomial time/space complexity

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (6)

Definable Subsets of Polynomial-Time Algebraic Structures ⋮ Unnamed Item ⋮ Recursive terms in semantic programming ⋮ The expressiveness of looping terms in the semantic programming ⋮ On termination of transactions over semantic document models ⋮ Logical language of description of polynomial computing

Cites Work

• Conditional terms in semantic programming
• Document models
• Computational Complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of formulas in semantic programming