Algebraic and fixed point equations over inverse limits of algebras

DOI10.1016/S0304-3975(06)80002-2zbMath0788.68093OpenAlexW4210540924MaRDI QIDQ1177146

Viggo Stoltenberg-Hansen, J. V. Tucker

Publication date: 26 June 1992

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(06)80002-2

zbMATH Keywords

algebraic equationsfixed point equationsinverse limits of algebrastheory of semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (16)

Full abstraction and recursion ⋮ The connection between initial and unique solutions of domain equations in the partial order and metric approach ⋮ Effective inseparability in a topological setting ⋮ Reducibility of domain representations and Cantor–Weihrauch domain representations ⋮ Topological methods for algebraic specification ⋮ Synchronous cooperation for explicit multi-threading ⋮ Computable concurrent processes ⋮ Domain representability of metric spaces ⋮ Can partial indexings be totalized? ⋮ A thread calculus with molecular dynamics ⋮ Representations versus numberings: On the relationship of two computability notions ⋮ Concrete models of computation for topological algebras ⋮ Computation by `While' programs on topological partial algebras ⋮ Domain representations of topological spaces ⋮ Maximal and partial points in formal spaces ⋮ Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete inference system for a class of regular behaviours
• Global renaming operators in concrete process algebra
• Metric interpretations of infinite trees and semantics of non deterministic recursive programs
• A brief history of process algebra
• Process algebra for synchronous communication
• Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
• Complete local rings as domains
• Readies and Failures in the Algebra of Communicating Processes
• Infinite trees in normal form and recursive equations having a unique solution
• Formal computations of non deterministic recursive program schemes

This page was built for publication: Algebraic and fixed point equations over inverse limits of algebras