Completeness problems in classes of computable named functions

DOI10.1007/BF01070586MaRDI QIDQ3033303zbMATH OpenFDO

Authors D. B. Buj, B. V. Gubskij, V. N. Red'ko

Publication date 1988

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01070586

zbMATH Keywords

program algebrasprogram synthesissemantic models of programs

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• On classes of computable functions
• On a family of precomplete classes of recursive functions and predicates
• scientific article; zbMATH DE number 4083606
• scientific article; zbMATH DE number 4134026
• scientific article; zbMATH DE number 23020

Cites work

• Composition aspects of programmology. I
• Composition semantics of programming languages
• Computable compositions and universal program logics
• Computable queries for relational data bases
• Computable stack functions for semantics of stack programs
• scientific article; zbMATH DE number 3471979 (Why is no real title available?)
• scientific article; zbMATH DE number 3248792 (Why is no real title available?)

Cited in

(8)

• Problem of checking the functional completeness in the class of piecewise parallel functions
• Computability of functions over metanominative data
• scientific article; zbMATH DE number 3977003 (Why is no real title available?)
• scientific article; zbMATH DE number 4112573 (Why is no real title available?)
• scientific article; zbMATH DE number 23020 (Why is no real title available?)
• scientific article; zbMATH DE number 845602 (Why is no real title available?)
• On classes of computable functions
• A finite set of functions with an EXPTIME-complete composition problem

This page was built for publication: Completeness problems in classes of computable named functions

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