Conditional terms in semantic programming
From MaRDI portal
Recommendations
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)