Previous |  Up |  Next

Article

Title: Horn clause programs and recursive functions defined by systems of equations (English)
Author: Šebelík, Jan
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 18
Issue: 2
Year: 1982
Pages: 106-120
.
Category: math
.
MSC: 03D10
MSC: 03D20
MSC: 03D60
MSC: 68C30
MSC: 68Q65
MSC: 68T15
idZBL: Zbl 0489.03013
idMR: MR679783
.
Date available: 2009-09-24T17:26:43Z
Last updated: 2012-06-05
Stable URL: http://hdl.handle.net/10338.dmlcz/124459
.
Reference: [1] C. L. Chang R. T. C. Lee: Symbolic Logic and Mechanical Theorem Proving.Academic Press New York 1971.
Reference: [2] S. C. Kleene: Introduction to Metamathematics.North-Holland Publishing Co. - Amsterodam, P. Noordhoff N. V. - Groningen 1967.
Reference: [3] R. Kowalski: Logic for Problem Solving.North-Holland, New York 1979. Zbl 0426.68002, MR 0572084
Reference: [4] J. Šebelík P. Štěpánek: Horn clause programs suggested by recursive functions.In: Prcceedings of the Logic Programming Workshop (S. Å. Tärnlund, ed.), Debrecen (Hungary), July 14-16, 1980.
Reference: [5] J. Šebelík P. Štěpánek: Horn clause programs for recursive functions.Preprint, 1980.
Reference: [6] S. Å. Tärnlund: Logic Information Processing.TRITA-IBADB-91029, 1975-11-24, Dept. Comp. Sci., Royal Institute of Tech., Stockholm 1975.
Reference: [7] S. Å. Tärnlund: Horn clause computability.BIT 17 (1977), 215-226. MR 0491111
.

Files

Files Size Format View
Kybernetika_18-1982-2_2.pdf 823.0Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo