Abstract computability and algebraic specification

DOI10.1145/505372.505375zbMath1365.68333OpenAlexW2021405727WikidataQ128924623 ScholiaQ128924623MaRDI QIDQ5738956

Jeffery Zucker, J. V. Tucker

Publication date: 13 June 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/505372.505375

zbMATH Keywords

equational logicalgebraic specificationcomputable analysistopological algebrasconditional equationsabstract computabilitymetric algebras

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Abstract data types; algebraic specification (68Q65) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (3)

Primitive recursive selection functions for existential assertions over abstract algebras ⋮ Computable total functions on metric algebras, universal algebraic specifications and dynamical systems ⋮ Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms

This page was built for publication: Abstract computability and algebraic specification