Rigid binary relations on a 4-element domain

DOI10.1007/S11083-016-9394-ZMaRDI QIDQ523155zbMATH OpenOpenAlexFDO

Authors Qinghe Sun

Publication date 20 April 2017

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11083-016-9394-z

zbMATH Keywords

propositional logicclones

Mathematics Subject Classification ID

Relational systems, laws of composition (08A02) Operations and polynomials in algebraic structures, primal algebras (08A40)

Recommendations

• scientific article; zbMATH DE number 859903
• scientific article; zbMATH DE number 774085
• A strongly rigid ternary relation
• On binary relations without non-identical endomorphisms
• Propriétés de projection des relations binaires

Cites work

• scientific article; zbMATH DE number 1670830 (Why is no real title available?)
• scientific article; zbMATH DE number 3853164 (Why is no real title available?)
• scientific article; zbMATH DE number 3972929 (Why is no real title available?)
• scientific article; zbMATH DE number 1775538 (Why is no real title available?)
• scientific article; zbMATH DE number 859903 (Why is no real title available?)
• scientific article; zbMATH DE number 937380 (Why is no real title available?)
• scientific article; zbMATH DE number 5030273 (Why is no real title available?)
• A Probabilistic Approach to the Dichotomy Problem
• Algebras which are independently generated by every n elements
• Closed systems of functions and predicates
• Complexity of the homomorphism extension problem in the random case
• Constraint Satisfaction Problems of Bounded Width
• Minimal clones -- a minicourse
• Note on projective graphs
• On optimal strong Mal'cev conditions for congruence meet-semidistributivity in a locally finite variety
• On the algebraic structure of combinatorial problems
• Polymorphisms of small digraphs
• Some centralizing monoids on a three-element set
• Strongly rigid relations
• The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• The complexity of maximal constraint languages
• The complexity of satisfiability problems
• The effect of two cycles on the complexity of colourings by directed graphs
• Universal algebra and hardness results for constraint satisfaction problems

Cited in

(6)

• scientific article; zbMATH DE number 783959 (Why is no real title available?)
• Semirigid equivalence relations on a finite set
• A stronger form of the theorem on the existence of a rigid binary relation on any set
• A strongly rigid ternary relation
• Projection properties and reflexive binary relations
• scientific article; zbMATH DE number 1775538 (Why is no real title available?)

This page was built for publication: Rigid binary relations on a 4-element domain

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q523155)