Descending chains and antichains of the unary, linear, and monotone subfunction relations
From MaRDI portal
(Redirected from Publication:862976)
Recommendations
Cites work
- A structure theory for ordered sets
- Algebras of multiplace functions
- Boolean minors
- Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes
- Every countable lattice is a retract of a direct product of chains
- Galois theory for minors of finite functions
- scientific article; zbMATH DE number 3183157 (Why is no real title available?)
- scientific article; zbMATH DE number 3505053 (Why is no real title available?)
- scientific article; zbMATH DE number 1500515 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- scientific article; zbMATH DE number 5488086 (Why is no real title available?)
- NP-partitions over posets with an application to reducing the set of solutions of NP problems
- On idempotents and Green relations in the algebras of many-placed functions
- On the structure of semigroups
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
Cited in
(19)- Equivalence of operations with respect to discriminator clones
- Generalizations of Świerczkowski's lemma and the arity gap of finite functions
- Pivotal decomposition schemes inducing clones of operations
- Parametrized arity gap
- Labeled posets are universal
- On the effect of variable identification on the essential arity of functions on finite sets
- The arity gap of order-preserving functions and extensions of pseudo-Boolean functions
- Fine hierarchies via Priestley duality
- Additive decomposability of functions over abelian groups
- Clones with finitely many relative \({\mathcal R}\)-classes
- An infinite descending chain of Boolean subfunctions consisting of threshold functions
- Galois theory for analogical classifiers
- On the homomorphism order of labeled posets
- Decompositions of functions based on arity gap
- Clonoids of Boolean functions with a monotone or discriminator source clone
- Clonoids of Boolean functions with essentially unary, linear, semilattice, or 0- or 1-separating source and target clones
- Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
- On a class of bases for Boolean functions
- Fine hierarchies and m-reducibilities in theoretical computer science
This page was built for publication: Descending chains and antichains of the unary, linear, and monotone subfunction relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862976)
