Deterministic and nondeterministic computation, and horn programs, on abstract data types
type: Item
instance of: scholarly article
title: Deterministic and nondeterministic computation, and horn programs, on abstract data types
zbMATH Open document ID: 0768.68094
DOI: 10.1016/0743-1066(92)90020-4
author: John V. Tucker
author: Jeffery Zucker
published in: The Journal of Logic Programming
publication date: 1992-08-13T00:00:00Z
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 08A70
Mathematics Subject Classification ID: 03D75
zbMATH DE Number: 39272
zbMATH Keywords: semicomputability
zbMATH Keywords: partial computable functions
zbMATH Keywords: computability over abstract structures
zbMATH Keywords: Horn programs
zbMATH Keywords: definability of relations on abstract structures
MaRDI profile type: Publication
full work available at URL: 0743-1066(92)90020-4
OpenAlex ID: W2014848011
Recommended article: Q4475108
Recommended article: Q4016523
Recommended article: Q4205083
Recommended article: Q3757375
Recommended article: Q4038725
Recommended article: Computability and implementability issues in abstract data types
Recommended article: Q3687690
Recommended article: Q4040341
Recommended article: Q3766854
Recommended article: Q3707378
description: scientific article; zbMATH DE number 39272