scientific article; zbMATH DE number 4045728

MaRDI QIDQ3783281zbMATH OpenFDO

Authors Yuri L. Ershov

Publication date 1986

zbMATH Keywords

admissible setsformal method for proving properties of algorithmslogic programmingprogramming operatorsrecursively enumerable sets over a constructive modelSigma-expressionsspecification of programs

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Applications of computability and recursion theory (03D80) General topics in the theory of software (68N01) Abstract data types; algebraic specification (68Q65)

Cited in

(7)

• Generatability of admissible sets
• scientific article; zbMATH DE number 4021108 (Why is no real title available?)
• scientific article; zbMATH DE number 4037166 (Why is no real title available?)
• scientific article; zbMATH DE number 4045729 (Why is no real title available?)
• scientific article; zbMATH DE number 4106288 (Why is no real title available?)
• scientific article; zbMATH DE number 1822171 (Why is no real title available?)
• Theory of symbolic expressions. I

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