scientific article; zbMATH DE number 3650557
From MaRDI portal
Publication:3208654
combinational automatacompleteness of k-valued logicfunction algebraheterogeneous automatainvariant relationsmany-sorted algebraspermutation groupsrealization of three-valued logic functions and relationsrelation algebrassemigroups of transformationssubgroups of symmetric groups
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Many-valued logic (03B50) Other algebras related to logic (03G25) Subgroups of symmetric groups (20B35) Semigroups of transformations, relations, partitions, etc. (20M20) Formal languages and automata (68Q45)
Cited in
(71)- A combinatorial constraint satisfaction problem dichotomy classification conjecture
- Association schemes of small order
- General metrics and contracting operations
- The number of orthogonal permutations
- Unique inclusions of maximal C-clones in maximal clones
- Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\)
- Completeness for concrete near-rings.
- On finitely related semigroups.
- Reflections on and of minor-closed classes of multisorted operations
- Reflections and powers of multisorted minions
- Minimal functions on the random graph
- Closed sets of finitary functions between products of finite fields of coprime order
- On the number of universal algebraic geometries
- The lattice of monomial clones on finite fields
- On polymorphism-homogeneous relational structures and their clones.
- Partial Sheffer operations
- Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin
- Minimal distance of propositional models
- The number of clones determined by disjunctions of unary relations
- What makes propositional abduction tractable
- The complexity of soft constraint satisfaction
- Combinatorial problems raised from 2-semilattices
- Finitely generated equational classes
- The lattice of quasiorder lattices of algebras on a finite set.
- Clones with nullary operations.
- Dualizing clones as models of Lawvere theories.
- A short introduction to clones.
- Constantive Mal’cev clones on finite sets are finitely related
- Maximal and minimal C-monoids
- Centralizer clones are preserved by category equivalences
- Galois theory for clones and superclones
- Category theoretic understandings of universal algebra and its dual: monads and Lawvere theories, comonads and what?
- Action of endomorphism semigroups on definable sets
- On the number of finite algebraic structures
- Clones from creatures
- Dualizing clones into categories of topological spaces.
- Invariants of monadic coalgebras
- Boolean max-co-clones
- Clones of (continuous) partial cofunctions
- Quantified Constraints in Twenty Seventeen
- Expansions of abelian square-free groups
- Closed sets of monomials in two variables generated by singletons
- scientific article; zbMATH DE number 7301721 (Why is no real title available?)
- Congruence preserving expansions of nilpotent algebras
- All centralising monoids with majority witnesses on a four-element set
- A survey on the fine-grained complexity of constraint satisfaction problems based on partial polymorphisms
- Automorphisms and strongly invariant relations
- Computing witnesses for centralising monoids on a three-element set
- \(S\)-preclones and the Galois connection \(^S\mathrm{Pol} - {^S\mathrm{Inv}}\). I.
- On polynomial completeness properties of finite Mal'cev algebras
- Introduction to clones of functions
- Ivo G. Rosenberg's work on maximal clones and minimal clones
- Ultralocally closed clones
- Spectrahedral shadows and completely positive maps on real closed fields
- Functional completeness and primitive positive decomposition of relations on finite domains
- On the number of aggregation functions on finite chains as a generalization of Dedekind numbers
- On when the union of two algebraic sets is algebraic
- Recognizing frozen variables in constraint satisfaction problems
- Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
- Symmetric linear arc monadic Datalog and gadget reductions
- Symmetric linear arc monadic Datalog and gadget reductions
- Classification of three-valued logical functions preserving 0
- Relational systems with trivial endomorphisms and polymorphisms
- H-coloring dichotomy revisited
- Hard constraint satisfaction problems have hard gaps at location 1
- The complexity of constraint satisfaction games and QCSP
- Towards a dichotomy theorem for the counting constraint satisfaction problem
- Maximal partial clones determined by the areflexive relations
- Computational complexity of auditing finite attributes in statistical databases
- On Boolean primitive positive clones
- Structure identification of Boolean relations and plain bases for co-clones
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 Q3208654)
