Final algebras, cosemicomputable algebras and degrees of unsolvability

DOI10.1016/0304-3975(92)90305-YzbMath0768.68093OpenAlexW2050029329WikidataQ127883873 ScholiaQ127883873MaRDI QIDQ1199822

Joseph A. Goguen, Lawrence S. Moss, José Meseguer

Publication date: 17 January 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90305-y

zbMATH Keywords

computabilityabstract data typesr.e. degreecongruences of finitely generated free algebrascosemicomputable many-sorted algebrasfinalitymany-sorted signatureminimal-state realizationssignature extensionTuring degree of a minimal algebra

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Abstract data types; algebraic specification (68Q65) Free algebras (08B20) Recursively (computably) enumerable sets and degrees (03D25)

Related Items

Modal logic and algebraic specifications ⋮ Computable total functions on metric algebras, universal algebraic specifications and dynamical systems ⋮ A hidden agenda

Cites Work

• Algebraic specifications of computable and semicomputable data types
• Final algebra semantics and data type extensions
• Data types, abstract data types and their specification problem
• Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
• CONSTRUCTIVE ALGEBRAS I
• Computable Algebra, General Theory and Theory of Computable Fields
• Realization is universal
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item