scientific article

Publication date: 18 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

relations posets algebraic specifications algebraic semantics algebras reduction systems

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Theory of computing (68Q99) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to general algebraic systems (08-01)

Related Items (77)

Fuzzy Horn logic. II. Implicationally defined classes. ⋮ Inductive \(^{*}\)-semirings ⋮ Unnamed Item ⋮ Closure properties for the class of behavioral models ⋮ Automated reasoning about cubic curves ⋮ The data type variety of stack algebras ⋮ Functional sorts in data type specifications ⋮ Pseudo-free families and cryptographic primitives ⋮ Recognizable sets of graphs: equivalent definitions and closure properties ⋮ Two algebraic approaches to variants of the concatenation product ⋮ Continuous monoids and semirings ⋮ Partial arithmetical data types of rational numbers and their equational specification ⋮ Theories of generalized Pascal triangles ⋮ Boolean logics with relations ⋮ Algebraic notions of nontermination: Omega and divergence in idempotent semirings ⋮ Rewriting systems over similarity and generalized pseudometric spaces and their properties ⋮ Closure structures parameterized by systems of isotone Galois connections ⋮ Parametric algebraic specifications with Gentzen formulas – from quasi-freeness to free functor semantics ⋮ A short overview of Hidden Logic ⋮ On formations of monoids ⋮ On Lindenmayerian algebraic power series ⋮ A general conservative extension theorem in process algebras with inequalities ⋮ The data type of spatial objects ⋮ A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices ⋮ On the coset laws for skew lattices ⋮ Classifying regular languages by their syntactic algebras ⋮ A categorical framework for the transformation of object-oriented systems: models and data ⋮ System theory for system identification. ⋮ On strongly symmetric skew lattices ⋮ Algebraic models of behaviour and correctness of SMT and CMT processors ⋮ Basic notions of universal algebra for language theory and graph grammars ⋮ The wheel of rational numbers as an abstract data type ⋮ Higher-order algebra with transfinite types ⋮ Reflection-closed varieties of multisorted algebras and minor identities ⋮ Reflections on and of minor-closed classes of multisorted operations ⋮ Reflections and powers of multisorted minions ⋮ Modal Rules are Co-Implications ⋮ Fuzzy logic programming reduced to reasoning with attribute implications ⋮ Picture deformation ⋮ Birkhoff's variety theorem in many sorts ⋮ Algebraic recognizability of regular tree languages ⋮ Equational tree transformations ⋮ Quasi-varieties: A special access ⋮ Triangular norm based predicate fuzzy logics ⋮ Minimal bases of temporal attribute implications ⋮ Confluence and termination of fuzzy relations ⋮ A relational account of call-by-value sequentiality ⋮ Intrinsic reasoning about functional programs. I: First order theories ⋮ Computational complexity of some problems involving congruences on algebras ⋮ Derivation digraphs for dependencies in ordinal and similarity-based data ⋮ Relational division in rank-aware databases ⋮ Pseudo-free families of computational universal algebras ⋮ Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs ⋮ Hilbert-style axiomatization of first-degree entailment and a family of its extensions ⋮ Meadows and the equational specification of division ⋮ On the finite embeddability property for residuated ordered groupoids ⋮ Division safe calculation in totalised fields ⋮ Equational Weighted Tree Transformations with Discounting ⋮ Equational weighted tree transformations ⋮ Equational theories for automata ⋮ Inductive proof search modulo ⋮ Factorization systems and fibrations ⋮ Supervisory Control with Complete Observations ⋮ Towards a proof of the decidability of the momentary stagnation of the growth function of D0L systems ⋮ Synchronized shuffles ⋮ The recognizability of sets of graphs is a robust property ⋮ An application of lattice theory to knowledge representation ⋮ Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols ⋮ Deciding the word problem for ground identities with commutative and extensional symbols ⋮ Positive varieties of tree languages ⋮ Unions of non-disjoint theories and combinations of satisfiability procedures ⋮ Pushdown tree automata, algebraic tree systems, and algebraic tree series ⋮ Fuzzy Horn logic. I. Proof theory. ⋮ A hidden Herbrand theorem: Combining the object and logic paradigms ⋮ Monoidal functional dependencies ⋮ Conservativity of nested relational calculi with internal generic functions ⋮ Moded and continuous abstract state machines

This page was built for publication: