scientific article
From MaRDI portal
zbMath0449.68003MaRDI QIDQ3896478
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Data structures (68P05) Applications of computability and recursion theory (03D80) Theory of operating systems (68N25) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
Positive algebras with countable congruence lattices, Enumerated algebras with uniformly recursive-separable classes, The data type variety of stack algebras, Algebraic simulations, Algebraic specifications of computable and semicomputable data types, What Is a Multi-modeling Language?, Conditional rewrite rules: Confluence and termination, Computably separable models, Algebras with finitely approximable positively representable enrichments, Uniformly computably separable algebras with effectively splittable families of negative congruences, Theory of computation over stream algebras, and its applications, Twenty years of rewriting logic, Preservation in many-valued truth institutions, Towards automated deduction in cP systems, Lower semilattices of separable congruences of numbered algebras, Separable algorithmic representations of classical systems and their applications, Unnamed Item, Unnamed Item, Specification and proof in membership equational logic, Equational abstractions, Conditional rewriting logic as a unified model of concurrency, Soundness in verification of algebraic specifications with OBJ, Generalized rewrite theories, coherence completion, and symbolic methods, Programming and symbolic computation in Maude, Semantics of algorithmic languages, Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms, Maude: specification and programming in rewriting logic, Contextual rewriting as a sound and complete proof method for conditional LOG-specifications
