scientific article

zbMath0418.03044MaRDI QIDQ3208654

L. A. Kaluzhnin, Reinhard Pöschel

Publication date: 1979

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

zbMATH Keywords

permutation groupsrelation algebrasfunction algebrainvariant relationssemigroups of transformationssubgroups of symmetric groupscombinational automatamany-sorted algebrascompleteness of k-valued logicheterogeneous automatarealization of three-valued logic functions and relations

Mathematics Subject Classification ID

Related Items (60)

The lattice of quasiorder lattices of algebras on a finite set. ⋮ General metrics and contracting operations ⋮ Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\) ⋮ Clones with nullary operations. ⋮ Dualizing clones as models of Lawvere theories. ⋮ A short introduction to clones. ⋮ Hard constraint satisfaction problems have hard gaps at location 1 ⋮ Completeness for concrete near-rings. ⋮ The complexity of constraint satisfaction games and QCSP ⋮ The number of orthogonal permutations ⋮ Category Theoretic Understandings of Universal Algebra and its Dual: Monads and Lawvere Theories, Comonads and What? ⋮ Galois theory for clones and superclones ⋮ What makes propositional abduction tractable ⋮ Unique inclusions of maximal C-clones in maximal clones ⋮ Unnamed Item ⋮ All centralising monoids with majority witnesses on a four-element set ⋮ Towards a dichotomy theorem for the counting constraint satisfaction problem ⋮ Unnamed Item ⋮ Automorphisms and strongly invariant relations ⋮ Computing witnesses for centralising monoids on a three-element set ⋮ Maximal partial clones determined by the areflexive relations ⋮ Action of endomorphism semigroups on definable sets ⋮ On finitely related semigroups. ⋮ On the number of finite algebraic structures ⋮ Quantified Constraints in Twenty Seventeen ⋮ Computational complexity of auditing finite attributes in statistical databases ⋮ On Boolean primitive positive clones ⋮ The complexity of soft constraint satisfaction ⋮ Dualizing clones into categories of topological spaces. ⋮ Boolean max-co-clones ⋮ The lattice of monomial clones on finite fields ⋮ Reflections on and of minor-closed classes of multisorted operations ⋮ Structure identification of Boolean relations and plain bases for co-clones ⋮ Reflections and powers of multisorted minions ⋮ Invariants of monadic coalgebras ⋮ On polymorphism-homogeneous relational structures and their clones. ⋮ 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 ⋮ Clones from creatures ⋮ Constantive Mal’cev clones on finite sets are finitely related ⋮ Partial Sheffer operations ⋮ Congruence preserving expansions of nilpotent algebras ⋮ Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin ⋮ Classification of three-valued logical functions preserving 0 ⋮ Closed sets of finitary functions between products of finite fields of coprime order ⋮ Relational systems with trivial endomorphisms and polymorphisms ⋮ Maximal and minimal C-monoids ⋮ Minimal distance of propositional models ⋮ The number of clones determined by disjunctions of unary relations ⋮ Unnamed Item ⋮ A combinatorial constraint satisfaction problem dichotomy classification conjecture ⋮ Unnamed Item ⋮ Centralizer clones are preserved by category equivalences ⋮ Expansions of abelian square-free groups ⋮ Association schemes of small order ⋮ On the number of universal algebraic geometries ⋮ Finitely generated equational classes ⋮ \(H\)-coloring dichotomy revisited

This page was built for publication: