Descending chains and antichains of the unary, linear, and monotone subfunction relations
From MaRDI portal
Publication:862976
DOI10.1007/S11083-006-9036-YzbMATH Open1124.08002OpenAlexW1994234838MaRDI QIDQ862976FDOQ862976
Authors: Erkko Lehtonen 
Publication date: 25 January 2007
Published in: Order (Search for Journal in Brave)
Full work available at URL: http://orbilu.uni.lu/handle/10993/3267
Recommendations
Partial orders, general (06A06) Relational systems, laws of composition (08A02) Operations and polynomials in algebraic structures, primal algebras (08A40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
- On the structure of semigroups
- Galois theory for minors of finite functions
- Algebras of multiplace functions
- Boolean minors
- Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes
- Title not available (Why is that?)
- NP-partitions over posets with an application to reducing the set of solutions of NP problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A structure theory for ordered sets
- Every countable lattice is a retract of a direct product of chains
- Title not available (Why is that?)
- On idempotents and Green relations in the algebras of many-placed functions
Cited In (17)
- Labeled posets are universal
- Clones with finitely many relative \({\mathcal R}\)-classes
- The arity gap of order-preserving functions and extensions of pseudo-Boolean functions
- Galois theory for analogical classifiers
- Decompositions of functions based on arity gap
- Additive decomposability of functions over abelian groups
- Fine hierarchies via Priestley duality
- Equivalence of operations with respect to discriminator clones
- Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
- Generalizations of Świerczkowski's lemma and the arity gap of finite functions
- Fine hierarchies and m-reducibilities in theoretical computer science
- On the effect of variable identification on the essential arity of functions on finite sets
- An infinite descending chain of Boolean subfunctions consisting of threshold functions
- Parametrized arity gap
- On a class of bases for Boolean functions
- On the homomorphism order of labeled posets
- Pivotal decomposition schemes inducing clones of operations
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)
