scientific article; zbMATH DE number 4174908

MaRDI QIDQ3199405zbMATH OpenFDO

Authors Yu. V. Golunkov

Publication date 1990

zbMATH Keywords

completenessdecidabilitypartial recursive functionsprogram schemesalgorithmic algebrasfunctional system of program type

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• On the edge-independence number and edge-covering number for regular graphs
• scientific article; zbMATH DE number 408816
• Publication:3199404
• scientific article; zbMATH DE number 5872251
• Relative completeness for logics of functional programs
• Completeness of type assignment systems with intersection, union, and type quantifiers
• Completeness in hybrid type theory
• scientific article; zbMATH DE number 4113956
• scientific article; zbMATH DE number 3938562

Cited in

(2)

• scientific article; zbMATH DE number 4174907 (Why is no real title available?)
• Completeness of combinations of constructor systems

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 Q3199405)