Approximate completeness in algebras of partial recursive functions and predicates

DOI10.1007/BF01070236MaRDI QIDQ3800018zbMATH OpenOpenAlexFDO

Authors Yu. V. Golunkov

Publication date 1987

Published in Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

algorithmic algebrasapproximate completenesscontinuum criterial systemprecomplete classesprogram logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Recursive functions and relations, subrecursive hierarchies (03D20) Theory of numerations, effectively presented structures (03D45)

Cited in

(9)

• Algebraic properties implying weak sequential completeness
• scientific article; zbMATH DE number 4134025 (Why is no real title available?)
• scientific article; zbMATH DE number 4134026 (Why is no real title available?)
• scientific article; zbMATH DE number 4174907 (Why is no real title available?)
• scientific article; zbMATH DE number 3841851 (Why is no real title available?)
• scientific article; zbMATH DE number 3857084 (Why is no real title available?)
• scientific article; zbMATH DE number 3868601 (Why is no real title available?)
• scientific article; zbMATH DE number 3877170 (Why is no real title available?)
• scientific article; zbMATH DE number 4083606 (Why is no real title available?)

This page was built for publication: Approximate completeness in algebras of partial recursive functions and predicates

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