Switch to: References

Add citations

You must login to add citations.
  1. Functional completeness and primitive positive decomposition of relations on finite domains.Sergiy Koshkin - 2024 - Logic Journal of the IGPL 32.
    We give a new and elementary construction of primitive positive decomposition of higher arity relations into binary relations on finite domains. Such decompositions come up in applications to constraint satisfaction problems, clone theory and relational databases. The construction exploits functional completeness of 2-input functions in many-valued logic by interpreting relations as graphs of partially defined multivalued ‘functions’. The ‘functions’ are then composed from ordinary functions in the usual sense. The construction is computationally effective and relies on well-developed methods of functional (...)
    Export citation