scientific article; zbMATH DE number 4125019

MaRDI QIDQ4205083zbMATH OpenFDO

Authors John V. Tucker, Jeffery Zucker

Publication date 1989

zbMATH Keywords

abstract data typesmany-sorted algebraalgebraic specificationGeneralized Church-Turing ThesisHorn clause computability

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Data structures (68P05) Artificial intelligence (68T99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Algebraic structures (08A99)

Recommendations

• Deterministic and nondeterministic computation, and horn programs, on abstract data types
• scientific article; zbMATH DE number 193539
• On computability by logic programs
• An external approach to abstract data types. I: Computability on abstract data type
• Abstract computability and algebraic specification

Cited in

(12)

• PROJECTIONS OF SEMICOMPUTABLE RELATIONS ON ABSTRACT DATA TYPES
• Theory of computation over stream algebras, and its applications
• Case-free programs: An abstraction of definite horn programs
• scientific article; zbMATH DE number 3898209 (Why is no real title available?)
• Horn logic, search and satisfiability. A collection of papers in memory of Robert G. Jeroslow
• scientific article; zbMATH DE number 1948386 (Why is no real title available?)
• scientific article; zbMATH DE number 193539 (Why is no real title available?)
• Deterministic and nondeterministic computation, and horn programs, on abstract data types
• Computability by means of effectively definable schemes and definability via enumerations
• scientific article; zbMATH DE number 3968568 (Why is no real title available?)
• scientific article; zbMATH DE number 1689578 (Why is no real title available?)
• A compositional semantic basis for the analysis of equational Horn programs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4205083)