Approximate completeness in algebras of partial recursive functions and predicates

DOI10.1007/BF01070236zbMath0654.03029OpenAlexW2054627574MaRDI QIDQ3800018

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

program logicprecomplete classesalgorithmic algebrasapproximate completenesscontinuum criterial system

Mathematics Subject Classification ID

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

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