scientific article; zbMATH DE number 4094815

MaRDI QIDQ3821585zbMATH OpenFDO

Authors B. V. Gubskij, E. V. Krapiva, I. V. Redko

Publication date 1988

zbMATH Keywords

computable functionsprimitive program algebrasrelational queries

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Relational systems, laws of composition (08A02) Information storage and retrieval of data (68P20)

Recommendations

• scientific article; zbMATH DE number 1904842
• Recursive characterization of computable real-valued functions and relations
• On classes of computable functions
• Universal computable enumerations of finite classes of families of total functions
• scientific article; zbMATH DE number 1512850
• scientific article; zbMATH DE number 4160710
• scientific article; zbMATH DE number 4112573
• Computable families of finite-valued computable functions
• scientific article; zbMATH DE number 1746042
• On computably enumerable structures

Cited in

(6)

• Classes of finite relations as initial abstract data types. I
• Algebraic composition of function tables
• scientific article; zbMATH DE number 4047051 (Why is no real title available?)
• Primitive program algebras of computable functions
• scientific article; zbMATH DE number 3893185 (Why is no real title available?)
• Composition aspects of programmology. II

This page was built for publication:

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