The expressiveness of looping terms in the semantic programming

DOI10.33048/SEMI.2020.17.024zbMath1445.68053arXiv1912.02731OpenAlexW3020534824MaRDI QIDQ2306056

Yanyan Li

Publication date: 20 March 2020

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

Full work available at URL: https://arxiv.org/abs/1912.02731

zbMATH Keywords

semantic programminglist structuresbounded quantificationreasoning complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Definable Subsets of Polynomial-Time Algebraic Structures ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of formulas in semantic programming
• Conditional terms in semantic programming
• Recursive terms in semantic programming
• Logical language of description of polynomial computing
• On decidability of list structures
• Computational Complexity

This page was built for publication: The expressiveness of looping terms in the semantic programming