scientific article
From MaRDI portal
Publication:3739181
zbMath0603.08004MaRDI QIDQ3739181
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
term operationsclonessemi-affine algebrasHomogeneous algebrasbasic operationsFunctionally complete algebraspara- primal algebras
Operations and polynomials in algebraic structures, primal algebras (08A40) Research exposition (monographs, survey articles) pertaining to general algebraic systems (08-02)
Related Items (99)
An algebraic theory of clones ⋮ A topological characterisation of endomorphism monoids of countable structures ⋮ Clones with nullary operations. ⋮ Dualizing clones as models of Lawvere theories. ⋮ A short introduction to clones. ⋮ Unnamed Item ⋮ Hard constraint satisfaction problems have hard gaps at location 1 ⋮ Maps between a space and its square ⋮ The complexity of constraint satisfaction games and QCSP ⋮ An equational logic sampler ⋮ Necessary Conditions for Tractability of Valued CSPs ⋮ Category Theoretic Understandings of Universal Algebra and its Dual: Monads and Lawvere Theories, Comonads and What? ⋮ Galois theory for semiclones ⋮ Groups with identical subgroup lattices in all powers ⋮ Unique inclusions of maximal C-clones in maximal clones ⋮ Affine spaces and algebras of subalgebras ⋮ Strong partial clones and the time complexity of SAT problems ⋮ Unnamed Item ⋮ Finite sublattices in the lattice of clones ⋮ Subdirectly irreducible algebras in one class of algebras with one operator and the main near-unanimity operation ⋮ Monoid intervals in lattices of clones ⋮ Unnamed Item ⋮ Towards a dichotomy theorem for the counting constraint satisfaction problem ⋮ Meet-irreducible submaximal clones determined by nontrivial equivalence relations ⋮ Finite generating sets for reversible gate sets under general conservation laws ⋮ The equational logic of fixed points ⋮ On the local closure of clones on countable sets ⋮ Unnamed Item ⋮ Totally symmetric functions are reconstructible from identification minors ⋮ Not all nilpotent monoids are finitely related ⋮ Generalized quasiorders and the Galois connection End-gQuord ⋮ Clones of topological spaces ⋮ Monoidal intervals on three- and four-element sets ⋮ NU Polymorphisms on Reflexive Digraphs ⋮ The wonderland of reflections ⋮ Closed sets of finitary functions between finite fields of coprime order ⋮ Neighborhoods and isolated points in spaces of functional clones on sets ⋮ Minimal quasivarieties of semilattices over commutative groups. ⋮ Modular subalgebra lattices ⋮ Learnability of quantified formulas. ⋮ The Complexity of Valued CSPs ⋮ The complexity of equality constraint languages ⋮ Quantified Constraints in Twenty Seventeen ⋮ The complexity of soft constraint satisfaction ⋮ Dualizing clones into categories of topological spaces. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Monoidal intervals of clones on infinite sets ⋮ The lattice of monomial clones on finite fields ⋮ Isomorphism and local isomorphism of clones of spaces ⋮ On the Computational Complexity of Non-Dictatorial Aggregation ⋮ Categorical aspects are useful for topology-after 30 years ⋮ Metrizability and coconnectedness ⋮ Structure identification of Boolean relations and plain bases for co-clones ⋮ On the clones of nilpotent groups with a verbal subgroup of prime order ⋮ Minimal sets and varieties ⋮ Transformation monoids with finite monoidal intervals ⋮ Rigid binary relations on a 4-element domain ⋮ A field guide to equational logic ⋮ Varieties generated by finite homogeneous algebras ⋮ On the expression complexity of equivalence and isomorphism of primitive positive formulas ⋮ On groups with every normal subgroup transitive or semiregular. ⋮ Simple Abelian algebras ⋮ A GENERAL DUALITY THEORY FOR CLONES ⋮ On polymorphism-homogeneous relational structures and their clones. ⋮ Quantified constraint satisfaction and the polynomially generated powers property ⋮ Recognizing frozen variables in constraint satisfaction problems ⋮ Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms ⋮ Minimal functions on the random graph ⋮ Combinatorial problems raised from 2-semilattices ⋮ On the Arrow property ⋮ A new tractable class of constraint satisfaction problems ⋮ Clones from creatures ⋮ Constantive Mal’cev clones on finite sets are finitely related ⋮ Commutator relations and the clones of finite groups. ⋮ Equivalence of operations with respect to discriminator clones ⋮ On the complexity of the clone membership problem ⋮ Maximal infinite-valued constraint languages ⋮ Closed sets of finitary functions between products of finite fields of coprime order ⋮ Meet-reducible submaximal clones determined by two central relations ⋮ All creatures great and small ⋮ Approximability of the Maximum Solution Problem for Certain Families of Algebras ⋮ Constraints, consistency and closure ⋮ On the algebraic structure of combinatorial problems ⋮ Unnamed Item ⋮ Abstract relations between functional clones ⋮ Constraint Satisfaction Problems for Reducts of Homogeneous Graphs ⋮ Unnamed Item ⋮ Circuits and expressions with nonassociative gates ⋮ Unnamed Item ⋮ The number of clones determined by disjunctions of unary relations ⋮ Truncation of unitary operads ⋮ Expansions of abelian square-free groups ⋮ A Normal Form and the Term-linearity of Affine Spaces over GF(3) ⋮ Recent Results on the Algebraic Approach to the CSP ⋮ Dualities for Constraint Satisfaction Problems ⋮ Constraint Satisfaction Problems with Infinite Templates ⋮ Comtrans algebras and bilinear forms ⋮ Reducibility of \(n\)-ary semigroups: from quasitriviality towards idempotency
This page was built for publication:
