Horn clause programs and recursive functions defined by systems of equations. (English) Zbl 0489.03013


03D20 Recursive functions and relations, subrecursive hierarchies
03D10 Turing machines and related notions
68T15 Theorem proving (deduction, resolution, etc.) (MSC2010)
03D60 Computability and recursion theory on ordinals, admissible sets, etc.
68Q65 Abstract data types; algebraic specification
Full Text: EuDML


[1] C. L. Chang R. T. C. Lee: Symbolic Logic and Mechanical Theorem Proving. Academic Press New York 1971.
[2] S. C. Kleene: Introduction to Metamathematics. North-Holland Publishing Co. - Amsterodam, P. Noordhoff N. V. - Groningen 1967. · Zbl 0047.00703
[3] R. Kowalski: Logic for Problem Solving. North-Holland, New York 1979. · Zbl 0426.68002
[4] J. Šebelík P. Štěpánek: Horn clause programs suggested by recursive functions. Prcceedings of the Logic Programming Workshop (S. Å. Tärnlund, Debrecen (Hungary), July 14-16, 1980.
[5] J. Šebelík P. Štěpánek: Horn clause programs for recursive functions. Preprint, 1980.
[6] S. Å. Tärnlund: Logic Information Processing. TRITA-IBADB-91029, 1975-11-24, Dept. Comp. Sci., Royal Institute of Tech., Stockholm 1975.
[7] S. Å. Tärnlund: Horn clause computability. BIT 17 (1977), 215-226. · Zbl 0359.02042
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.