scientific article; zbMATH DE number 51770
From MaRDI portal
Publication:4002149
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to general algebraic systems (08-01) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Theory of computing (68Q99)
Recommendations
Cited in
(84)- Higher-order algebra with transfinite types
- On strongly symmetric skew lattices
- An application of lattice theory to knowledge representation
- Triangular norm based predicate fuzzy logics
- Fuzzy Horn logic. II. Implicationally defined classes.
- The wheel of rational numbers as an abstract data type
- A categorical framework for the transformation of object-oriented systems: models and data
- Quasi-varieties: A special access
- Recognizable sets of graphs: equivalent definitions and closure properties
- Inductive proof search modulo
- Derivation digraphs for dependencies in ordinal and similarity-based data
- Universal algebra in higher types
- Equational tree transformations
- Closure properties for the class of behavioral models
- Theories of generalized Pascal triangles
- Equational weighted tree transformations
- Partial arithmetical data types of rational numbers and their equational specification
- Reflection-closed varieties of multisorted algebras and minor identities
- Reflections on and of minor-closed classes of multisorted operations
- Division safe calculation in totalised fields
- scientific article; zbMATH DE number 3874591 (Why is no real title available?)
- Meadows and the equational specification of division
- Computational complexity of some problems involving congruences on algebras
- Inductive \(^{*}\)-semirings
- Parametric algebraic specifications with Gentzen formulas – from quasi-freeness to free functor semantics
- A relational account of call-by-value sequentiality
- Algebraic models of behaviour and correctness of SMT and CMT processors
- Pushdown tree automata, algebraic tree systems, and algebraic tree series
- On the coset laws for skew lattices
- A hidden Herbrand theorem: Combining the object and logic paradigms
- Universal algebra and applications in theoretical computer science
- A general conservative extension theorem in process algebras with inequalities
- Unions of non-disjoint theories and combinations of satisfiability procedures
- Boolean logics with relations
- Closure structures parameterized by systems of isotone Galois connections
- Two algebraic approaches to variants of the concatenation product
- Positive varieties of tree languages
- Fuzzy Horn logic. I. Proof theory.
- Hilbert-style axiomatization of first-degree entailment and a family of its extensions
- Minimal bases of temporal attribute implications
- Rewriting systems over similarity and generalized pseudometric spaces and their properties
- On the finite embeddability property for residuated ordered groupoids
- Pseudo-free families and cryptographic primitives
- Factorization systems and fibrations: toward a fibred Birkhoff variety theorem
- The data type of spatial objects
- Algebraic notions of nontermination: Omega and divergence in idempotent semirings
- Conservativity of nested relational calculi with internal generic functions
- System theory for system identification.
- On formations of monoids
- scientific article; zbMATH DE number 1154177 (Why is no real title available?)
- scientific article; zbMATH DE number 46653 (Why is no real title available?)
- Fuzzy logic programming reduced to reasoning with attribute implications
- Algebraic recognizability of regular tree languages
- The recognizability of sets of graphs is a robust property
- On Lindenmayerian algebraic power series
- Confluence and termination of fuzzy relations
- Continuous monoids and semirings
- Basic notions of universal algebra for language theory and graph grammars
- Moded and continuous abstract state machines
- Automated reasoning about cubic curves
- Birkhoff's variety theorem in many sorts
- The data type variety of stack algebras
- Intrinsic reasoning about functional programs. I: First order theories
- Weakest precondition reasoning for expected run-times of probabilistic programs
- Deciding the word problem for ground identities with commutative and extensional symbols
- Monoidal functional dependencies
- Modal rules are co-implications
- Classifying regular languages by their syntactic algebras
- scientific article; zbMATH DE number 1839430 (Why is no real title available?)
- Pseudo-free families of computational universal algebras
- Equational weighted tree transformations with discounting
- Towards a proof of the decidability of the momentary stagnation of the growth function of D0L systems
- There are no post-quantum weakly pseudo-free families in any nontrivial variety of expanded groups
- Supervisory Control with Complete Observations
- Equational theories for automata
- Synchronized shuffles
- Functional sorts in data type specifications
- Picture deformation
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices
- scientific article; zbMATH DE number 4108840 (Why is no real title available?)
- A short overview of hidden logic
- Reflections and powers of multisorted minions
- Relational division in rank-aware databases
- Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4002149)
