A property of enumerable sets containing complexly deducible formulas

DOI10.1007/BF01117479zbMath0253.02038MaRDI QIDQ2557692

A. O. Slisenko

Publication date: 1973

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (1)

Finite approach to the problem of optimizing theorem-proving algorithms

Cites Work

• A Machine-Independent Theory of the Complexity of Recursive Functions

This page was built for publication: A property of enumerable sets containing complexly deducible formulas